How to draw a graph with duplicate edges in networkx in python

Question

I need to draw a graph with duplicate edges (i.e., more than one edge between 2 nodes). I tried:

import networkx as nx
edges = [(0, 1), (0, 1)]

G = nx.DiGraph ()
G.add_edges_from (edges)

print G.edges ()
#[(0, 1)]

Duplicate entries are simply discarded. Is there any way to do that?

its pretty easy to just generate your own DOT source ... not sure how you would do it with networkx — Joran Beasley
– Joran Beasley, Commented May 30, 2013 at 5:32
graphviz.org/content/dot-language ( see : stamm-wilbrandt.de/GraphvizFiddle/…) — Joran Beasley
– Joran Beasley, Commented Jun 22, 2017 at 5:10

Simon · Accepted Answer · 2013-05-30 06:19:56Z

6

I'm no expert on networkx either but, according to the documentation here:

Multigraphs NetworkX provides classes for graphs which allow multiple edges between any pair of nodes. The MultiGraph and MultiDiGraph classes allow you to add the same edge twice, possibly with different edge data. This can be powerful for some applications, but many algorithms are not well defined on such graphs. Shortest path is one example. Where results are well defined, e.g. MultiGraph.degree() we provide the function. Otherwise you should convert to a standard graph in a way that makes the measurement well defined.

Thus, the example should work if one change is made - create G as follows:

G = nx.MultiGraph()

answered May 30, 2013 at 6:19

Simon

10.9k1 gold badge34 silver badges48 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

How to draw a graph with duplicate edges in networkx in python

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related