mirror of
https://github.com/trekhleb/javascript-algorithms.git
synced 2025-12-08 19:06:00 +00:00
27 lines
1.2 KiB
Markdown
27 lines
1.2 KiB
Markdown
# Bridges in Graph
|
|
|
|
In graph theory, a **bridge**, **isthmus**, **cut-edge**, or **cut arc** is an edge
|
|
of a graph whose deletion increases its number of connected components. Equivalently,
|
|
an edge is a bridge if and only if it is not contained in any cycle. A graph is said
|
|
to be bridgeless or isthmus-free if it contains no bridges.
|
|
|
|
|
|
|
|
A graph with 16 vertices and 6 bridges (highlighted in red)
|
|
|
|
|
|
|
|
An undirected connected graph with no cut edges
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
## References
|
|
|
|
- [GeeksForGeeks on YouTube](https://www.youtube.com/watch?v=thLQYBlz2DM&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8)
|
|
- [Wikipedia](https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29#Tarjan.27s_Bridge-finding_algorithm)
|
|
- [GeeksForGeeks](https://www.geeksforgeeks.org/bridge-in-a-graph/)
|