While analyzing source code of some old libraries I saw references to the QuickGraph.dll and QuickGraph.Algorithms.dll both in version 2.4.2.175. In QuickGraph.Algorithms.MaximumFlow namespace I've found PushRelabelMaximumFlowAlgorithm
In the non-integer capacity case, the time complexity of EdmondsKarpMaximumFlowAlgorithm is O(V E^2) which is worse than the time complexity of the PushRelabelMaximumFlowAlgorithm O(V^2E^1/2) for all but the sparsest of graphs.
I do not see PushRelabelMaximumFlowAlgorithm in the current latest version.
Are there any reasons it was removed?
Regards,
Sebastian
While analyzing source code of some old libraries I saw references to the QuickGraph.dll and QuickGraph.Algorithms.dll both in version 2.4.2.175. In QuickGraph.Algorithms.MaximumFlow namespace I've found PushRelabelMaximumFlowAlgorithm
In the non-integer capacity case, the time complexity of EdmondsKarpMaximumFlowAlgorithm is O(V E^2) which is worse than the time complexity of the PushRelabelMaximumFlowAlgorithm O(V^2E^1/2) for all but the sparsest of graphs.
I do not see PushRelabelMaximumFlowAlgorithm in the current latest version.
Are there any reasons it was removed?
Regards,
Sebastian