Bridge in graph

Dependencies:

1. Path in Graph

An edge in an undirected graph is called a bridge (or cut-edge) iff deleting that edge disconnects the connected component to which that edge belongs.

Dependency for:

1. Deleting bridge from graph gives 2 components
2. Deleting edge from tree gives 2 trees
3. Spanning forest contains all bridges

Info:

• Depth: 2
• Number of transitive dependencies: 5

Transitive dependencies:

1. /sets-and-relations/equivalence-classes
2. /sets-and-relations/relation-composition-is-associative
3. /sets-and-relations/equivalence-relation
4. Graph
5. Path in Graph