python graph-tool: Fastest way to add edges without duplicates?

Question

What's the fastest/most performant way to add edges without duplicates to a digraph in Python's graph-tool?

The naive solution would be to call g.edge(u, v) before adding edges, but that seems like quite a performance hit, especially in scale-free networks. Does g.edge(u, v) do lookups in O(1) if g.set_fast_edge_removal() has been set? I imagine whatever additional data structure graph-tool allocates for that is something along the lines of an edge list.

Peaceful · Accepted Answer · 2018-12-24 13:53:04Z

4

In my opinion, it is best to add all the edges, and then remove the parallel edges.

You can add edges as a list:

g = gt.Graph()
edges = [(1, 2), (2, 5), (1, 2)]
g.add_edge_list(edges)
gt.remove_parallel_edges(g)

answered Dec 24, 2018 at 13:53

Peaceful

5,56016 gold badges61 silver badges87 bronze badges

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

Collectives™ on Stack Overflow

python graph-tool: Fastest way to add edges without duplicates?

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