DiGraph.

has_node

Returns True if the graph contains the node n.

Identical to n in G

n in G

n (node)

Examples

>>> G = nx.path_graph(3) # or DiGraph, MultiGraph, MultiDiGraph, etc >>> G.has_node(0) True

It is more readable and simpler to use

>>> 0 in G True