wheel_graph(n, create_using=None)

The wheel graph consists of a hub node connected to a cycle of (n-1) nodes.

Parameters

n : int or iterable

If an integer, node labels are 0 to n with center 0. If an iterable of nodes, the center is the first.

create_using : NetworkX graph constructor, optional (default=nx.Graph)

Graph type to create. If graph instance, then cleared before populated.

Node labels are the integers 0 to n - 1. :

Return the wheel graph

Examples

See :

Back References

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

networkx.algorithms.similarity.optimize_graph_edit_distance networkx.algorithms.similarity.graph_edit_distance networkx.algorithms.similarity.optimal_edit_paths networkx.algorithms.chordal.complete_to_chordal_graph

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/generators/classic.py#671
type: <class 'function'>
Commit: