Efficient Implementation of Sparse Graphs with Numpy
Project description
planning.py shows how to use this graph with graph_search.
graph_sparsification.py shows how to sparsify a graph
batch_sparsification.py efficiently sparsify a graph with as a batch
incremental_api.py shows how to extend with sparsity
Usage
To instantiate a graph:
graph = AsymMesh(n=10_000, k=6, dim=2, img_dim=[2], kernel_fn=l2, embed_fn=id2D, d_max=20)
graph.extend(xys, images=xys, meta=xys)
graph.update_zs()
graph.update_edges()
Most of the time it is better to enforce sparsity of the graph by only adding new vertices when there is no existing vertex that is close-by. The new dedupe API allows us to do this in a batch fashion:
spots = graph.dedupe(images=xys, r_min=r_min)
xys = xys[spots]
ds = graph.to_goal(zs_2=xys)
if ds.size == 0:
graph.extend(xys, images=xys, meta=xys)
else:
m = ds.min(axis=-1) >= r_min
if m.sum() > 0:
graph.extend(xys[m], images=xys[m], meta=xys[m])
graph.update_edges()
Dense |
Sparse |
Details |
---|---|---|
10x more edges in the dense graph in comparison to the sparse graph. |
To Experiment
Import this module in the method module.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distributions
Built Distribution
Hashes for sparse_graphs-0.0.2-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 393a7e96e7f40491ea1aab651bdcd372bcdaca9ebc48bef594068ff7adaa08ee |
|
MD5 | 8f27c61e240567552d3a8a44d5093938 |
|
BLAKE2b-256 | f9b851d35cf1c9b883c1be43559cd41cf36c0bbe13bb8b9443f056a7d335f712 |