Jack Edmonds and his colleague gave the first formal proof that the maximum flow problem in a network can be solved in polynomial time, providing a solution to determine the flow of information through a communication network.