As stated in the tutorial , each vertex has a unique number as its id, starting from 0 continuously to N-1, where N is the number of vertices in the graph. However, the id for a vertex p may change if one vertex prior to it was deleted from the graph. So what is the most efficient way to refer to p …

The name attribute is treated in a special way by the internals of the Python interface; in particular, the name attribute is indexed internally in a Python dict so looking up the ID of a node given its name attribute is an O(1) operation (on average). The index is invalidated if you mutate the grap…

most efficient way to refer to a vertex in a graph

Usage

szhorvat Split this topic 7 September 2021 13:20 8

A post was split to a new topic: Check if vertex exists, create it if it doesn’t

Topic		Replies	Views
Making it possible to use arbitrary vertex names Development Python	23	1225	15 November 2021
What is the node order of Graph.indegree()? Usage Python	3	180	19 December 2022
Check if vertex exists, create it if it doesn't--igraph is Much Slower than Networkx Usage Python	3	1620	9 September 2021
How can I query a vertex/edge according to its attribute? Usage C	4	329	20 February 2023
How to let graph have “correct” indices？ Usage Python	3	188	19 July 2023

most efficient way to refer to a vertex in a graph

Related Topics