The maximum flow problem was formulated by T.E. Harris as follows: Consider a rail network connecting two cities by way of a number of intermediate cities, where each link of the network has a number assigned to it representing its capacity. Assuming a steady state condition, a nd a maximal flow from one given city to the other. Back in the mid 1950s the US Military had an interest in finding out how much capacity the Soviet railway network had to move cargo from the Western Soviet Union to Eastern Europe. This lead to the Maximum Flow problem and the Ford–Fulkerson algorithm to solve it. Read more Max De Marzi, is a master web developer and graph database enthusiast. Follow his blog posts in the Architects Zone on DZone.  

Keywords:  


Leave a Reply

Your email address will not be published. Required fields are marked *