Module for netting flows, e.g. payments, between entities
The problem that this repo tries to solve is this: Given a directed weighted graph, remove as many edges as possibles and reduce the weights as much as possible, while not changing the total net weight of all edges connected to a vertex.