{
    "info": {
        "author": "Harold Cooper",
        "author_email": "harold@mit.edu",
        "bugtrack_url": null,
        "classifiers": [],
        "description": "This Python module computes equivalent resistance or conductance in simple\r\ncircuits. Furthermore, since any weighted graph can be considered as a network\r\nof resistors, this code can be used to provide a general graph distance metric.",
        "description_content_type": null,
        "docs_url": null,
        "download_url": "http://syzygy.st/Public/conductance.tgz",
        "downloads": {
            "last_day": -1,
            "last_month": -1,
            "last_week": -1
        },
        "home_page": "http://syzygy.st/code.html#conductance",
        "keywords": "",
        "license": "",
        "maintainer": "",
        "maintainer_email": "",
        "name": "conductance",
        "package_url": "https://pypi.org/project/conductance/",
        "platform": "",
        "project_url": "https://pypi.org/project/conductance/",
        "project_urls": {
            "Download": "http://syzygy.st/Public/conductance.tgz",
            "Homepage": "http://syzygy.st/code.html#conductance"
        },
        "release_url": "https://pypi.org/project/conductance/0.1/",
        "requires_dist": null,
        "requires_python": null,
        "summary": "circuit algorithm and graph metric",
        "version": "0.1"
    },
    "last_serial": 321349,
    "releases": {
        "0.1": []
    },
    "urls": []
}