networkx 2.8.2 Pypi GitHub Homepage
Other Docs
ParametersReturnsBackRef
parse_adjlist(lines, comments='#', delimiter=None, create_using=None, nodetype=None)

Parameters

lines : list or iterator of strings

Input data in adjlist format

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

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

nodetype : Python type, optional

Convert nodes to this type.

comments : string, optional

Marker for comment lines

delimiter : string, optional

Separator for node labels. The default is whitespace.

Returns

G: NetworkX graph

The graph corresponding to the lines in adjacency list format.

Parse lines of a graph adjacency list representation.

See Also

read_adjlist

Examples

>>> lines = ["1 2 5", "2 3 4", "3 5", "4", "5"]
... G = nx.parse_adjlist(lines, nodetype=int)
... nodes = [1, 2, 3, 4, 5]
... all(node in G for node in nodes) True
>>> edges = [(1, 2), (1, 5), (2, 3), (2, 4), (3, 5)]
... all((u, v) in G.edges() or (v, u) in G.edges() for (u, v) in edges) True
See :

Back References

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

networkx.readwrite.adjlist.parse_adjlist

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/readwrite/adjlist.py#140
type: <class 'function'>
Commit: