perf(graph): optimize BFS in findConnectedGraph

[muhabdulkadir]

Closes #

Optimize the BFS traversal in DirectedGraph.findConnectedGraph to eliminate O(n) array re-indexing on each iteration.

Changes

• Replace Array.shift() with an index pointer for O(1) dequeue
• Replace plain object visited map with Set to avoid prototype collisions
• Replace forEach with for-loops to avoid per-iteration closure allocation

Flags

• No API or behavioral changes; purely internal performance improvement

Screenshots or Video

Related Issues

• Issue #
• Pull Request #

Author Checklist

• Ensure you provide a DCO sign-off for your commits using the --signoff option of git commit.
• Vital features and changes captured in unit and/or integration tests
• Commits messages follow AP format
• Extend the documentation, if necessary
• Merging to main from fork:branchname