#

flow-decomposition

Here are 2 public repositories matching this topic...

infovillasimius / flows

Network Flows Optimization - Shortest Path, Max Flow and Min Cost Flow Algorithms in Python

dijkstra dijkstra-algorithm shortest-path circular-queue ford-fulkerson max-flow flows min-cost-flow bellman-ford-algorithm negative-cycles radix-heap preflow-push successive-shortest-paths radix-heap-queue flow-decomposition label-correcting-algorithms simple-path

Updated Sep 13, 2019
Python

algbio / flowpaths

A Python package to quickly decompose weighted graphs (acyclic or not) into weighted paths or walks, under various models.

bioinformatics graph-algorithms network-analysis bioinformatics-analysis flows integer-linear-programming flow-decomposition network-flows

Updated Nov 25, 2025
Python

Improve this page

Add a description, image, and links to the flow-decomposition topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the flow-decomposition topic, visit your repo's landing page and select "manage topics."