Graph Theorymedium
0:00.0
In a directed graph, a strongly connected component is a maximal set of vertices where every vertex can reach every other vertex. How many strongly connected components does a directed acyclic graph (DAG) with 5 vertices have (at minimum)?
In a directed graph, a strongly connected component is a maximal set of vertices where every vertex can reach every other vertex. How many strongly connected components does a directed acyclic graph (DAG) with 5 vertices have (at minimum)?