Explore three graph-structure algorithms on small example graphs.
Topological sort applies only to DAGs. Strongly connected components partition directed graphs into maximal mutually reachable groups. Articulation points are vertices whose removal increases the number of connected components in an undirected graph.