This documents the development version of NetworkX. Documentation for the current release can be found here.
Returns True if the graph contains the node n.
Identical to n in G
n in G
>>> G = nx.path_graph(3) # or DiGraph, MultiGraph, MultiDiGraph, etc
It is more readable and simpler to use
>>> 0 in G