…1295)

Redundant adjacency matrix variants — the adjacency list versions
(LazyPrimsAdjacencyList, EagerPrimsAdjacencyList, TopologicalSortAdjacencyList)
are more efficient and already cover the same algorithms.

Co-authored-by: Claude Opus 4.6 <[email protected]>

* Refactor BFS, remove FastQueue and Recursive duplicates

Remove BreadthFirstSearchAdjacencyListIterativeFastQueue (custom IntQueue
variant redundant with ArrayDeque) and BreadthFirstSearchRecursive (recursive
BFS with queue-passing hack). Refactor the remaining BFS implementation
with improved docs, final fields, and cleaner code style.

Co-Authored-By: Claude Opus 4.6 <[email protected]>

* Rename BreadthFirstSearchAdjacencyListIterative to BreadthFirstSearchAdjacencyList

Drop "Iterative" from the class and file name now that the recursive and
fast-queue variants have been removed. Replace the 13-node example with
a simpler 8-node graph including a visual diagram.

Co-Authored-By: Claude Opus 4.6 <[email protected]>

* Remove cost from Edge class and simplify helpers for unweighted BFS

BFS operates on unweighted graphs, so the cost field and weighted edge
helpers are unnecessary. Rename addUnweightedUndirectedEdge to
addUndirectedEdge.

Co-Authored-By: Claude Opus 4.6 <[email protected]>

* Simplify reconstructPath: use LinkedList.addFirst to avoid reverse

Co-Authored-By: Claude Opus 4.6 <[email protected]>

* Fix Integer reference comparison bug in reconstructPath

Use intValue() instead of != to avoid reference comparison failure
for node indices >= 128 (outside Integer cache range).

Co-Authored-By: Claude Opus 4.6 <[email protected]>

---------

Co-authored-by: Claude Opus 4.6 <[email protected]>

* Refactor BridgesAdjacencyList: add docs, clean up code

Co-Authored-By: Claude Opus 4.6 <[email protected]>

* Change findBridges return type from flat List<Integer> to List<int[]>

Each bridge is now returned as an int[2] pair instead of two consecutive
elements in a flat list. Updated both test files accordingly.

Co-Authored-By: Claude Opus 4.6 <[email protected]>

* Clarify findBridges Javadoc with concrete example

Co-Authored-By: Claude Opus 4.6 <[email protected]>

* Document parallel-edge limitation in BridgesAdjacencyList

Co-Authored-By: Claude Opus 4.6 <[email protected]>

* Remove BridgesAdjacencyListIterative and its test

Redundant with the recursive BridgesAdjacencyList implementation.

Co-Authored-By: Claude Opus 4.6 <[email protected]>

---------

Co-authored-by: Claude Opus 4.6 <[email protected]>