networkx.generators.classic.null_graph
networkx.generators.classic.star_graph
Enter search terms or a module, class or function name.
Return the Path graph P_n of n nodes linearly connected by n-1 edges.
Node labels are the integers 0 to n - 1. If create_using is a DiGraph then the edges are directed in increasing order.