Implementation of the Fork Fulkerson method to find the max posible flow of a network
Project description
This package implements the Fork Fulkerson algorithm to find the maximum posible flow in a network.
The Ford-Fulkerson method answers the question of given a network with vertices and edges between those vertices that have certain weights, how much “flow” can the network process at a time?
Change Log
0.0.1 (17/03/21)
First release
0.0.2 (18/03/21)
Name change
0.0.3 (18/03/21)
Better docstrings
0.0.4 (27/03/21)
Trying out the long description
0.0.5 (21/04/21)
Reimplementations and reinforcement
0.0.6 (24/04/21) - Change in warning for loops
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
ffmaxflow-0.0.6.tar.gz
(4.3 kB
view hashes)