connectivity (373B)
1 # Connectivity 2 3 Problem of knowing how many edges/vertices you must remove from a [graph] in order to disconnect it ([connected_component]) 4 5 - [vertex_connectivity] 6 - [edge_connectivity] 7 8 - [connectivity_weighted] 9 10 - [dynamic_connectivity] 11 12 - [strongly_connected_graph] 13 - [weakly_connected_graph] 14 15 See also: [mengers_theorem], [minimum_cut], [connected_graph] 16 17 Up: [graph]