Cost minimal maximum flow in graphs: Ford-Fulkerson 2
Aus Operations-Research-Wiki
Version vom 26. Juni 2013, 12:10 Uhr von Fwschmid (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „'''Ford –Fulkerson-Algorithm''' The Ford-Fulkerson-Algorithm [FFA] belongs to the graph theory and was developed by Lester Randolph Ford and Delbert Ray Ful…“)
Ford –Fulkerson-Algorithm
The Ford-Fulkerson-Algorithm [FFA] belongs to the graph theory and was developed by Lester Randolph Ford and Delbert Ray Fulkerson in 1956. Compared to Dijkstra or Floyed algorithm it should find the shortest way in the graph. The FFA should find the cost minimal maximum flow in a graph.To be able to find the cost minimal maximum flow in a graph from one node to another you need know the maximal flow and the costs for one unit of flow for every edge.
