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-355) Provide Flow algorithms
Date Mon, 23 Jan 2012 22:55:40 GMT


Claudio Squarcella updated SANDBOX-355:

    Attachment: SANDBOX-355_FordFulkersonImplementationAndTest.patch


find attached an implementation for the algorithm of Ford and Fulkerson to find the max flow
in a network.

The implementation is split between a main class {{FordFulkerson}} which provides two public
methods (one for generic weights, the other for {{Integer}} weights) and an auxiliary class
{{FlowNetworkHandler}} which does the dirty job. 

I also implemented a test using [this example|]
and it runs just fine.

I am available for clarifications and comments.
> Provide Flow algorithms
> -----------------------
>                 Key: SANDBOX-355
>                 URL:
>             Project: Commons Sandbox
>          Issue Type: New Feature
>          Components: Graph
>            Reporter: Simone Tripodi
>         Attachments: SANDBOX-355_FordFulkersonImplementationAndTest.patch
> right now the {{org.apache.commons.graph.flow}} package contains an empty implementation
of [Ford-Fulkerson|]'s algorithm,
that needs to be filled.
> Other algorithms that work on resolving Flow-related problems, are welcome.

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