[
https://issues.apache.org/jira/browse/SANDBOX-385?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Claudio Squarcella updated SANDBOX-385:
---------------------------------------
Attachment: SANDBOX-385_AddedEdmondsKarpImplementationAndTest.patch
Hello,
I implemented Edmonds-Karp plus a test for it.
I also found a bug in the previous implementation of
{{DefaultVisitAlgorithmsSelector}} and fixed it: vertices are added to the
visit stack/queue only if the edge leading to them is actually discovered.
Finally I extracted common code in the {{FlowNetworkHandler}} creating a
utility class called {{FlowNetwork}}, that represents a directed graph with
flow capacity.
Hoping this helps,
Claudio
> Provide Edmonds-Karp algorithm
> ------------------------------
>
> Key: SANDBOX-385
> URL: https://issues.apache.org/jira/browse/SANDBOX-385
> Project: Commons Sandbox
> Issue Type: Improvement
> Components: Graph
> Reporter: Marco Speranza
> Attachments: SANDBOX-385_AddedEdmondsKarpImplementationAndTest.patch
>
>
> Add the [Edmonds-Karp|http://en.wikipedia.org/wiki/Edmonds-Karp_algorithm]
> algorithm into org.apache.commons.graph.flow package.
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators:
https://issues.apache.org/jira/secure/ContactAdministrators!default.jspa
For more information on JIRA, see: http://www.atlassian.com/software/jira
