Search found 1 match

by Tutte
Wed Feb 13, 2008 2:08 am
Forum: Volume 105 (10500-10599)
Topic: 10594 - Data Flow
Replies: 40
Views: 25878

Can anyone post any more test data for this problem? I already checked testcases posted here and my program gives valid answers. There's probably a silly little possibility which I miss by some way.

I use Ford-Bellman algorithm for computing cheapest augmenting paths.

Go to advanced search