Graph TheoryEasyDirected Graphs and Network Flows
Directed Graphs and Network Flows · Easy problem
A digraph has vertices and arcs , , , , , , . What is the largest value of over all five vertices ?
A digraph has vertices and arcs , , , , , , . What is the largest value of over all five vertices ?