Is there an algorithm in networkxto handle fully (or very high) related oriented graphs (DiGraphs)?
I have a network of threads that are all non-zero, but very different in size. I want to visualize the network, but I need a reasonable way to find the basic structure, where, ideally, each node will have a maximum of one and one thread.
NB This is the concept of "nodal flows" as described by Nystuen and Dacy (1961) , but I do not know what the modern equivalent is called
source
share