networkx.DiGraph.has_node
networkx.DiGraph.has_edge
Enter search terms or a module, class or function name.
Return True if n is a node, False otherwise. Use the expression ‘n in G’.
Examples
>>> G = nx.Graph() # or DiGraph, MultiGraph, MultiDiGraph, etc >>> G.add_path([0,1,2,3]) >>> print 1 in G True