2
votes
How to compute edge and node bottleneck coefficients in a weighted directed graph using networkx?
Afaict, networkx uses capacities instead of weights to determine the edge cuts, and the error you're seeing is because there are no capacities set on your edges, so it defaults to infinite capacity ...
- 1,340
1
vote
Large Graphs: NetworkX distributed alternative
For anyone having the same question, I found a distributed alternative, that has compatible api with networkx called GraphScope. They're using an in-memory immutable data manager called vineyard, my ...
- 111
Only top scored, non community-wiki answers of a minimum length are eligible