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
0.0.7 (26/04/21)
Prints warnings instead of returning them.
0.0.8 (27/04/21)
Adds self-explanatory messages in loop errors.
0.0.9 (27/04/21)
Change in warning messages for repeated sink and source nodes.
1 maintainer
Release files for ffmaxflow 0.0.9
For a detailed explanation of source distributions (sdists) and built distributions (wheels), please see the package formats documentation.
Source distribution (sdist)
| File | Size | Uploaded | |
|---|---|---|---|
| ffmaxflow-0.0.9.tar.gz | 4.8 kB | Details |
Release files / ffmaxflow-0.0.9.tar.gz
| Download URL | ffmaxflow-0.0.9.tar.gz |
|---|---|
| Size | 4.8 kB |
| Tags | Source |
|
SHA-256 checksum How to use checksums |
64eb45f43a0864c03ab8cc73f26843ddd60bc1b4a923ee99974e5eb1b1ae92c5
|
|
BLAKE2b-256 checksum How to use checksums |
991b7ed018b7ab8dec358f248b064e7ea4927582fde93419647efdd74206a076
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
No |
| Uploaded via |
twine/3.4.1 importlib_metadata/3.7.3 pkginfo/1.6.1 requests/2.24.0 requests-toolbelt/0.9.1 tqdm/4.50.2 CPython/3.8.5
|
