adjacency-list-graphbuilder

adjacency-list-graphbuilder

A tiny utility to build an undirected adjacency-list graph from a list of edges.

If you don't provide n (the number of nodes), it's inferred automatically from the highest node index found in edges.

Note: Version 0.1.0 was published with an incorrect README that referenced an old package name (graphbuilder). The actual importable package name has always been adjacency_list_graphbuilder. This has been corrected starting from version 0.1.1. If you installed 0.1.0, please upgrade using pip install --upgrade adjacency-list-graphbuilder.

Install

pip install adjacency-list-graphbuilder

Usage

from adjacency_list_graphbuilder import build_graph

edges = [[0, 1], [0, 2], [1, 2], [2, 3], [1, 3]]

# n is optional — inferred automatically
graph = build_graph(edges)
print(graph)
# [[1, 2], [0, 2, 3], [0, 1, 3], [2, 1]]

# or provide n explicitly (e.g. to include isolated nodes)
graph = build_graph(edges, n=6)
print(graph)
# [[1, 2], [0, 2, 3], [0, 1, 3], [2, 1], [], []]

License

MIT