Graph TheoryHardDirected Graphs and Network Flows
Directed Graphs and Network Flows · Hard problem
A digraph has vertices with arcs , , , , , , , , . Collapse every strongly connected component to a single point to form the condensation. How many arcs does the condensation have?