pydistancematrix will partition a list of edges based on a hard limit of nodes per graph.
Essentially, this module will take a graph and partition it into subgraphs of a hard limit size, returning both the lists of nodes in each sub-graph, and the list of edges that are ‘cut’ by the partitioning.
For example:
>>> import distancematrix
>>> distancematrix.matrix_calls([
(1, 2),
(2, 3),
(7, 8),
(9, 10)], limit=3)
[[1, 2, 3], [7, 8], [9, 10]], []
License
BSD
1 maintainer
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
distancematrix-0.0.1.tar.gz
(2.2 kB
view details)
File details
Details for the file distancematrix-0.0.1.tar.gz.
File metadata
- Download URL: distancematrix-0.0.1.tar.gz
- Upload date:
- Size: 2.2 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
c8ba35e64e941e859becf165e745cfdfe4390699afa0b49095a4cf046d2098d1
|
|
| MD5 |
1f31862acb48a7dadeec046b368928eb
|
|
| BLAKE2b-256 |
343dbad8c4da0afea44421c3c51d0a7088e150974875685ebf90550ce35043cb
|
