equal
deleted
inserted
replaced
105 /// "flow of maximum value" in a digraph \cite clrs01algorithms, |
105 /// "flow of maximum value" in a digraph \cite clrs01algorithms, |
106 /// \cite amo93networkflows, \cite goldberg88newapproach. |
106 /// \cite amo93networkflows, \cite goldberg88newapproach. |
107 /// The preflow algorithms are the fastest known maximum |
107 /// The preflow algorithms are the fastest known maximum |
108 /// flow algorithms. The current implementation uses a mixture of the |
108 /// flow algorithms. The current implementation uses a mixture of the |
109 /// \e "highest label" and the \e "bound decrease" heuristics. |
109 /// \e "highest label" and the \e "bound decrease" heuristics. |
110 /// The worst case time complexity of the algorithm is \f$O(n^2\sqrt{e})\f$. |
110 /// The worst case time complexity of the algorithm is \f$O(n^2\sqrt{m})\f$. |
111 /// |
111 /// |
112 /// The algorithm consists of two phases. After the first phase |
112 /// The algorithm consists of two phases. After the first phase |
113 /// the maximum flow value and the minimum cut is obtained. The |
113 /// the maximum flow value and the minimum cut is obtained. The |
114 /// second phase constructs a feasible maximum flow on each arc. |
114 /// second phase constructs a feasible maximum flow on each arc. |
115 /// |
115 /// |