View Code? Open in Web Editor
NEW
This project forked from abuelhassan/competitive-programming-golang
competitive-programming-golang's Introduction
The Inclusion-Exclusion Principle
Connected components, bridges, articulations points
Definitions (that may not be accurate)
- In a connected undirected graph, a bridge is an edge that if removed the graph becomes disconnected.
- In a connected undirected graph, an articulation point or a cut vertex is a node that if removed the graph
becomes disconnected.
- A strongly connected component is a graph where every two nodes are reachable from each others.
competitive-programming-golang's People
Contributors
Stargazers