Skip to main content

Optimally call distance matrix information for list of origin-dest pairs.

Project description

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

Author

Mike Axiak

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Files for distancematrix, version 0.0.1
Filename, size File type Python version Upload date Hashes
Filename, size distancematrix-0.0.1.tar.gz (2.2 kB) File type Source Python version None Upload date Hashes View

Supported by

AWS AWS Cloud computing Datadog Datadog Monitoring DigiCert DigiCert EV certificate Facebook / Instagram Facebook / Instagram PSF Sponsor Fastly Fastly CDN Google Google Object Storage and Download Analytics Pingdom Pingdom Monitoring Salesforce Salesforce PSF Sponsor Sentry Sentry Error logging StatusPage StatusPage Status page