equal
deleted
inserted
replaced
43 /// |
43 /// |
44 ///\param Graph The directed graph type the algorithm runs on. |
44 ///\param Graph The directed graph type the algorithm runs on. |
45 ///\param LengthMap The type of the length map (values should be nonnegative). |
45 ///\param LengthMap The type of the length map (values should be nonnegative). |
46 /// |
46 /// |
47 ///\note It it questionable whether it is correct to call this method after |
47 ///\note It it questionable whether it is correct to call this method after |
48 ///%Suurballe for it is just a special case of Edmond's and Karp's algorithm |
48 ///%Suurballe for it is just a special case of Edmonds' and Karp's algorithm |
49 ///for finding minimum cost flows. In fact, this implementation just |
49 ///for finding minimum cost flows. In fact, this implementation just |
50 ///wraps the MinCostFlow algorithms. The paper of both %Suurballe and |
50 ///wraps the MinCostFlow algorithms. The paper of both %Suurballe and |
51 ///Edmonds-Karp published in 1972, therefore it is possibly right to |
51 ///Edmonds-Karp published in 1972, therefore it is possibly right to |
52 ///state that they are |
52 ///state that they are |
53 ///independent results. Most frequently this special case is referred as |
53 ///independent results. Most frequently this special case is referred as |