{
    "info": {
        "author": "Pedro Matiello",
        "author_email": "pedro@pmatiello.me",
        "bugtrack_url": null,
        "classifiers": [
            "Development Status :: 5 - Production/Stable",
            "Intended Audience :: Developers",
            "License :: OSI Approved :: MIT License",
            "Operating System :: OS Independent",
            "Programming Language :: Python",
            "Topic :: Scientific/Engineering :: Mathematics",
            "Topic :: Software Development :: Libraries :: Python Modules"
        ],
        "description": "*python-graph* is a library for working with graphs in Python.\r\n\r\nThis software provides \ufeffa suitable data structure for representing graphs and a\r\nwhole set of important algorithms.\r\n\r\nThe code is appropriately documented and API reference is generated\r\nautomatically by epydoc.\r\n\r\nComments, bug reports and suggestions are welcome.\r\n\r\nProvided features and algorithms:\r\n\r\n * Support for directed, undirected, weighted and non-weighted graphs\r\n * Support for hypergraphs\r\n * Canonical operations\r\n * XML import and export\r\n * DOT-Language import and export (for usage with Graphviz)\r\n * Random graph generation\r\n\r\n * Accessibility (transitive closure)\r\n * Breadth-first search\r\n * Critical path algorithm\r\n * Cut-vertex and cut-edge identification\r\n * Cycle detection\r\n * Depth-first search\r\n * Gomory-Hu cut-tree algorithm\r\n * Heuristic search (A* algorithm)\r\n * Identification of connected components\r\n * Maximum-flow / Minimum-cut (Edmonds-Karp algorithm)\r\n * Minimum spanning tree (Prim's algorithm)\r\n * Mutual-accessibility (strongly connected components)\r\n * Pagerank algorithm\r\n * Shortest path search (Dijkstra's algorithm)\r\n * Shortest path search (Bellman-Ford algorithm)\r\n * Topological sorting\r\n * Transitive edge identification",
        "description_content_type": null,
        "docs_url": null,
        "download_url": "",
        "downloads": {
            "last_day": -1,
            "last_month": -1,
            "last_week": -1
        },
        "home_page": "https://github.com/pmatiello/python-graph",
        "keywords": "python, graphs, hypergraphs, networks, library, algorithms",
        "license": "",
        "maintainer": "",
        "maintainer_email": "",
        "name": "python-graph",
        "package_url": "https://pypi.org/project/python-graph/",
        "platform": "",
        "project_url": "https://pypi.org/project/python-graph/",
        "project_urls": {
            "Homepage": "https://github.com/pmatiello/python-graph"
        },
        "release_url": "https://pypi.org/project/python-graph/1.8.2/",
        "requires_dist": null,
        "requires_python": null,
        "summary": "A library for working with graphs in Python",
        "version": "1.8.2"
    },
    "last_serial": 3831902,
    "releases": {
        "0.65": [],
        "0.75": [],
        "0.85": [],
        "1.0.0": [],
        "1.1.0": [],
        "1.1.1": [],
        "1.2.0": [],
        "1.3.0": [],
        "1.3.1": [],
        "1.4.0": [],
        "1.4.1": [],
        "1.4.2": [],
        "1.5.0": [],
        "1.6.0": [],
        "1.6.1": [],
        "1.6.2": [],
        "1.6.3": [],
        "1.7.0": [],
        "1.8.0": [],
        "1.8.1": [],
        "1.8.2": []
    },
    "urls": []
}