{
    "info": {
        "author": "Mike Axiak",
        "author_email": "mike@axiak.net",
        "bugtrack_url": null,
        "classifiers": [
            "Development Status :: 3 - Alpha",
            "Operating System :: OS Independent",
            "Programming Language :: Python"
        ],
        "description": "pydistancematrix\n=================\n\npydistancematrix will partition a list of edges based on a hard limit of\nnodes per graph.\n\nEssentially, this module will take a graph and partition it into subgraphs\nof a hard limit size, returning both the lists of nodes in each sub-graph,\nand the list of edges that are 'cut' by the partitioning.\n\nFor example::\n\n    >>> import distancematrix\n\n    >>> distancematrix.matrix_calls([\n        (1, 2),\n        (2, 3),\n        (7, 8),\n        (9, 10)], limit=3)\n    [[1, 2, 3], [7, 8], [9, 10]], []\n\nLicense\n--------\n\nBSD\n\nAuthor\n-------\n\nMike Axiak",
        "description_content_type": null,
        "docs_url": null,
        "download_url": "UNKNOWN",
        "downloads": {
            "last_day": -1,
            "last_month": -1,
            "last_week": -1
        },
        "home_page": "http://github.com/axiak/pydistancematrix",
        "keywords": null,
        "license": "BSD",
        "maintainer": null,
        "maintainer_email": null,
        "name": "distancematrix",
        "package_url": "https://pypi.org/project/distancematrix/",
        "platform": "UNKNOWN",
        "project_url": "https://pypi.org/project/distancematrix/",
        "project_urls": {
            "Download": "UNKNOWN",
            "Homepage": "http://github.com/axiak/pydistancematrix"
        },
        "release_url": "https://pypi.org/project/distancematrix/0.0.1/",
        "requires_dist": null,
        "requires_python": null,
        "summary": "Optimally call distance matrix information for list of origin-dest pairs.",
        "version": "0.0.1"
    },
    "last_serial": 788994,
    "releases": {
        "0.0.1": [
            {
                "comment_text": "",
                "digests": {
                    "md5": "1f31862acb48a7dadeec046b368928eb",
                    "sha256": "c8ba35e64e941e859becf165e745cfdfe4390699afa0b49095a4cf046d2098d1"
                },
                "downloads": -1,
                "filename": "distancematrix-0.0.1.tar.gz",
                "has_sig": false,
                "md5_digest": "1f31862acb48a7dadeec046b368928eb",
                "packagetype": "sdist",
                "python_version": "source",
                "requires_python": null,
                "size": 2240,
                "upload_time": "2012-01-05T22:04:26",
                "url": "https://files.pythonhosted.org/packages/34/3d/bad8c4da0afea44421c3c51d0a7088e150974875685ebf90550ce35043cb/distancematrix-0.0.1.tar.gz"
            }
        ]
    },
    "urls": [
        {
            "comment_text": "",
            "digests": {
                "md5": "1f31862acb48a7dadeec046b368928eb",
                "sha256": "c8ba35e64e941e859becf165e745cfdfe4390699afa0b49095a4cf046d2098d1"
            },
            "downloads": -1,
            "filename": "distancematrix-0.0.1.tar.gz",
            "has_sig": false,
            "md5_digest": "1f31862acb48a7dadeec046b368928eb",
            "packagetype": "sdist",
            "python_version": "source",
            "requires_python": null,
            "size": 2240,
            "upload_time": "2012-01-05T22:04:26",
            "url": "https://files.pythonhosted.org/packages/34/3d/bad8c4da0afea44421c3c51d0a7088e150974875685ebf90550ce35043cb/distancematrix-0.0.1.tar.gz"
        }
    ]
}