networkx 2.8.2 Pypi GitHub Homepage
Other Docs
ParametersBackRef
add_path(G_to_add_to, nodes_for_path, **attr)

Parameters

G_to_add_to : graph

A NetworkX graph

nodes_for_path : iterable container

A container of nodes. A path will be constructed from the nodes (in order) and added to the graph.

attr : keyword arguments, optional (default= no attributes)

Attributes to add to every edge in path.

Add a path to the Graph G_to_add_to.

See Also

add_cycle
add_star

Examples

>>> G = nx.Graph()
... nx.add_path(G, [0, 1, 2, 3])
... nx.add_path(G, [10, 11, 12], weight=7)
See :

Back References

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

networkx.classes.multidigraph.MultiDiGraph.remove_edge networkx.classes.multigraph.MultiGraph.has_edge networkx.classes.function.add_path networkx.classes.multigraph.MultiGraph.remove_edge networkx.algorithms.traversal.breadth_first_search.bfs_predecessors networkx.classes.function.add_star networkx.classes.multigraph.MultiGraph.get_edge_data networkx.algorithms.shortest_paths.generic.all_shortest_paths networkx.classes.function.get_edge_attributes networkx.algorithms.traversal.breadth_first_search.bfs_successors networkx.classes.digraph.DiGraph.remove_edge networkx.algorithms.isomorphism.isomorph.is_isomorphic networkx.algorithms.assortativity.neighbor_degree.average_neighbor_degree networkx.algorithms.components.connected.connected_components networkx.algorithms.components.weakly_connected.weakly_connected_components networkx.classes.function.add_cycle networkx.algorithms.traversal.breadth_first_search.bfs_tree

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#263
type: <class 'function'>
Commit: