Multiline Adjacency List¶
Multi-line Adjacency List¶
Read and write NetworkX graphs as multi-line adjacency lists.
The multi-line adjacency list format is useful for graphs with nodes that can be meaningfully represented as strings. With this format simple edge data can be stored but node or graph data is not.
The first label in a line is the source node label followed by the node degree d. The next d lines are target node labels and optional edge data. That pattern repeats for all nodes in the graph.
The graph with edges a-b, a-c, d-e can be represented as the following adjacency list (anything following the # in a line is a comment):
# example.multiline-adjlist a 2 b c d 1 e
||Read graph in multi-line adjacency list format from path.|
||Write the graph G in multiline adjacency list format to path|
||Parse lines of a multiline adjacency list representation of a graph.|
||Generate a single line of the graph G in multiline adjacency list format.|