[
https://issues.apache.org/jira/browse/SANDBOX-355?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Claudio Squarcella updated SANDBOX-355:
---------------------------------------
Attachment: SANDBOX-355_FordFulkersonImplementationAndTest.patch
Hi,
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|http://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm#Integral_example]
and it runs just fine.
I am available for clarifications and comments.
Ciao,
Claudio
> Provide Flow algorithms
> -----------------------
>
> Key: SANDBOX-355
> URL: https://issues.apache.org/jira/browse/SANDBOX-355
> 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|http://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm]'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:
https://issues.apache.org/jira/secure/ContactAdministrators!default.jspa
For more information on JIRA, see: http://www.atlassian.com/software/jira
