Graph concepts

Bridge

A bridge, isthmus, cut-edge or cut arc is an edge of Graph G whose deletion increases its number of connected components.1

1. Bridge Wiki#Bridge-finding_algorithm) ↩

results matching ""

    No results matching ""