Graph TheoryEasyDirected Graphs and Network Flows
Directed Graphs and Network Flows · Easy problem
Five teams play a round robin, with results , , , , , , , , , (arrow from winner to loser). What is the second-highest score (number of wins) among the five teams?