Graph TheoryEasyDirected Graphs and Network Flows
Directed Graphs and Network Flows · Easy problem
A digraph has vertices and arcs , , , . What is the size of the strongly connected component containing vertex ?
A digraph has vertices and arcs , , , . What is the size of the strongly connected component containing vertex ?