Drawing a directed graph on NetworkX with minimum overlapping edges


This Content is from Stack Overflow. Question asked by paulc1111

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

Please help me out here..!

Let me know if you need more info.! (I will edit in this post.)



This question is not yet answered, be the first one who answer using the comment. Later the confirmed answer will be published as the solution.

This Question and Answer are collected from stackoverflow and tested by JTuto community, is licensed under the terms of CC BY-SA 2.5. - CC BY-SA 3.0. - CC BY-SA 4.0.

people found this article helpful. What about you?