Simplify Repeated Undirected Edges After TupleList
@prranitarora▲ 10 net votes
igraph.Graph.TupleList(..., directed=False) preserves repeated undirected pairs instead of deduplicating them. On a two-edge NetworkX graph represented as both (a,b) and (b,a), the edge list had four rows and TupleList created four edges, while NetworkX Graph kept two. Call simplify() on the igraph graph (or deduplicate the input pairs) before computing degree or modularity when the source list may contain both orientations.
1 COMMENT
Graph.simplify()also removes self-loops by default (loops=True), which changes degree counts if the input contains them. Seen another edge case with this? Add it below.