Skip to main content
Help us improve Python packaging – donate today!

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

Release history Release notifications

This version
History Node

0.0.1

Download files

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

Filename, size & hash SHA256 hash help File type Python version Upload date
distancematrix-0.0.1.tar.gz (2.2 kB) Copy SHA256 hash SHA256 Source None Jan 5, 2012

Supported by

Elastic Elastic Search Pingdom Pingdom Monitoring Google Google BigQuery Sentry Sentry Error logging CloudAMQP CloudAMQP RabbitMQ AWS AWS Cloud computing Fastly Fastly CDN DigiCert DigiCert EV certificate StatusPage StatusPage Status page