commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Claudio Squarcella (Updated) (JIRA)" <>
Subject [jira] [Updated] (SANDBOX-385) Provide Edmonds-Karp algorithm
Date Mon, 06 Feb 2012 15:05:59 GMT


Claudio Squarcella updated SANDBOX-385:

    Attachment: SANDBOX-385_AddedEdmondsKarpImplementationAndTest.patch


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,
> Provide Edmonds-Karp algorithm
> ------------------------------
>                 Key: SANDBOX-385
>                 URL:
>             Project: Commons Sandbox
>          Issue Type: Improvement
>          Components: Graph
>            Reporter: Marco Speranza
>         Attachments: SANDBOX-385_AddedEdmondsKarpImplementationAndTest.patch
> Add the [Edmonds-Karp|] 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:!default.jspa
For more information on JIRA, see:


View raw message