Drawing a directed graph with NetworkX by overlapping minimum edges

paulc1111 0
Viewed 18

I'm trying to draw a directed graph in python with networkx

It uses Fruchterman-Reingold force-directed algorithm to position nodes. However, I couldn't get a result of graph with minimum overlapping edges. I want something like this in NetworkX or some other python API.

Can Fruchterman-Reingold algorithm produce a graph with minimum overlapping edges? If it can, which parameter should I adjust? If it can not, is there any API or alogrithm to use in python?

My code to visualize

pos = nx.spring_layout(G, k=100, iterations=500, seed=1)

enter image description here

Let me know if you need more info.!

Thanks!

directed-graph networkx python
0 Answers
Related