Graph Theoryeasy
0:00.0
A strongly connected component in a directed graph is a maximal set of vertices where there is a directed path from any vertex to any other. How many strongly connected components does the empty directed graph on 5 vertices have?
A strongly connected component in a directed graph is a maximal set of vertices where there is a directed path from any vertex to any other. How many strongly connected components does the empty directed graph on 5 vertices have?