This is a pre-production deployment of Warehouse. Changes made here affect the production instance of PyPI (pypi.python.org).
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 History

This version
History Node

0.0.1

Download Files

Download Files

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

File Name & Checksum SHA256 Checksum Help Version File Type Upload Date
distancematrix-0.0.1.tar.gz (2.2 kB) Copy SHA256 Checksum SHA256 Source Jan 5, 2012

Supported By

WebFaction WebFaction Technical Writing Elastic Elastic Search Pingdom Pingdom Monitoring Dyn Dyn DNS Sentry Sentry Error Logging CloudAMQP CloudAMQP RabbitMQ Heroku Heroku PaaS Kabu Creative Kabu Creative UX & Design Fastly Fastly CDN DigiCert DigiCert EV Certificate Rackspace Rackspace Cloud Servers DreamHost DreamHost Log Hosting