GeezerVison

This package already contains TarjanBridges, which implements the same DFS/low-link bridge-finding algorithm: https://github.com/TheAlgorithms/Java/blob/96ed2d7970606b51014afd25212c6c86d2af6255/src/main/java/com/thealgorithms/graph/TarjanBridges.java

Please consolidate this contribution into that implementation rather than maintaining a second copy of the algorithm. In particular, preserve the edge-ID handling and add the parallel-edge regression test to TarjanBridgesTest: for two vertices joined by two parallel edges, the existing implementation incorrectly reports one bridge, while this implementation correctly reports none. If an edge-list entry point is useful, it can be added to TarjanBridges while preserving the existing API and sharing the traversal logic. Please update the PR title/description to explain the resulting improvement.

The O(V + E) claim does not account for bridges.sort(...) at lines 79–82. With B returned bridges, the implemented method has an upper bound of O(V + E + B log B). Please update the complexity documentation if sorted output is retained, and document the endpoint normalization and lexicographic ordering in the return contract. Alternatively, remove the sorting if ordering is not part of the intended API.