Release Notes for Version 0.1

Features in Version 0.1

• Basic functionality for connecting sources to targets using a minimum-cost flow approach.
• Treats all graph edges as undirected.
• In the input, edges with a higher rank are assigned a lower cost in the graph structure.

Algorithm Details

The script minCostFlow.py attempts to connect sources to targets in a graph using a minimum-cost flow algorithm.

More details of the algorithm can be found in:
Automating parameter selection to avoid implausible biological pathway models.

Dependencies

• Google's OR-Tools library (Version: 9.4.1874)
• Python 3 (Versions 3.10.4 or 3.10.7 recommended)