#

Note

This documents the development version of NetworkX. Documentation for the current release can be found here.

#

networkx.generators.classic.path_graph

path_graph(n, create_using=None)

Returns the Path graph P_n of linearly connected 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.