23 Kasım 2009 Pazartesi

Maximum s-t Network Flow Algorithms

Recently, at one of the course at Boğaziçi University, we learned maximum s-t flow algorithms. One of the challenging part is to understand these algorithms and make them work on a sample graph. I guess that I can able to solve these algorithms on a given graph. Since the web lacks of the example run of both three algorithms; Capacity Scaling Algorithm, Edmond's Karp Algorithm and Ford Fulkerson Algorithm, I decided to post this message to the interested people.

This is the sample run of both of the three algorithms, I will be happy if the figures are helpful,

Hiç yorum yok: