nodes(G)

Returns an iterator over the graph nodes.

Examples

See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

networkx.classes.multidigraph.MultiDiGraph networkx.classes.digraph.DiGraph networkx.classes.function.restricted_view networkx.algorithms.simple_paths.is_simple_path networkx.readwrite.graph6._generate_graph6_bytes networkx.classes.graph.Graph.update networkx.classes.graph.Graph networkx.algorithms.clique.find_cliques networkx.classes.multigraph.MultiGraph networkx.classes.graph.Graph.subgraph networkx.algorithms.clique.node_clique_number networkx.readwrite.sparse6._generate_sparse6_bytes networkx.algorithms.approximation.traveling_salesman.traveling_salesman_problem networkx.algorithms.clique.find_cliques_recursive networkx.algorithms.bipartite.redundancy.node_redundancy

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them

---

GitHub : /networkx/classes/function.py#56
type: <class 'function'>
Commit: