[igraph] searching by node index: runtime analysis

[Ahmed Abdeen Hamed]

Hello, friends,

Happy new year!

What the runtime analysis for retrieving the index of a node by its name? 

For example: If I would like to search a network for two given nodes we know in advance (cancer, diabetes), and then check if there is a path in between, what is runtime complexity for this step in igraph?

Thanks in advance,

-Ahmed