read_adjlist(path, comments='#', delimiter=None, create_using=None, nodetype=None, encoding='utf-8')
This format does not store graph or node data.
Filename or file handle to read. Filenames ending in .gz or .bz2 will be uncompressed.
Graph type to create. If graph instance, then cleared before populated.
Convert nodes to this type.
Marker for comment lines
Separator for node labels. The default is whitespace.
The graph corresponding to the lines in adjacency list format.
Read graph in adjacency list format from path.
>>> G = nx.path_graph(4)
... nx.write_adjlist(G, "test.adjlist")
... G = nx.read_adjlist("test.adjlist")
The path can be a filehandle or a string with the name of the file. If a filehandle is provided, it has to be opened in 'rb' mode.
>>> fh = open("test.adjlist", "rb")
... G = nx.read_adjlist(fh)
Filenames ending in .gz or .bz2 will be compressed.
>>> nx.write_adjlist(G, "test.adjlist.gz")
... G = nx.read_adjlist("test.adjlist.gz")
The optional nodetype is a function to convert node strings to nodetype.
For example
>>> G = nx.read_adjlist("test.adjlist", nodetype=int)
will attempt to convert all nodes to integer type.
Since nodes must be hashable, the function nodetype must return hashable types (e.g. int, float, str, frozenset - or tuples of those, etc.)
The optional create_using parameter indicates the type of NetworkX graph created. The default is :None:None:`nx.Graph`, an undirected graph. To read the data as a directed graph use
>>> G = nx.read_adjlist("test.adjlist", create_using=nx.DiGraph)See :
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.readwrite.adjlist.parse_adjlist
networkx.readwrite.adjlist.read_adjlist
networkx.readwrite.adjlist.generate_adjlist
networkx.readwrite.edgelist.generate_edgelist
networkx.readwrite.adjlist.write_adjlist
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