{ "info": { "author": "Anton Afanassiev", "author_email": "antonafana@yahoo.ca", "bugtrack_url": null, "classifiers": [ "Development Status :: 5 - Production/Stable" ], "description": "A NetworkX graph theory package that calculates the edge search number of a tree. The algorithm is based off of The Complexity of Searching a Graph by N. Megiddo et. al. The algorithm runs in O(nlog(n)) and is very fast for small to mid sized trees (hundreds of vertices).", "description_content_type": null, "docs_url": null, "download_url": "https://github.com/Jabbath/Tree-Edge-Search-Number/archive/1.0.3.tar.gz", "downloads": { "last_day": -1, "last_month": -1, "last_week": -1 }, "home_page": "https://github.com/Jabbath/Tree-Edge-Search-Number", "keywords": "graph,theory,search,number,edge,pursuit,evasion,tree", "license": "MIT", "maintainer": "", "maintainer_email": "", "name": "tree-edge-search", "package_url": "https://pypi.org/project/tree-edge-search/", "platform": "", "project_url": "https://pypi.org/project/tree-edge-search/", "project_urls": { "Download": "https://github.com/Jabbath/Tree-Edge-Search-Number/archive/1.0.3.tar.gz", "Homepage": "https://github.com/Jabbath/Tree-Edge-Search-Number" }, "release_url": "https://pypi.org/project/tree-edge-search/1.0.3/", "requires_dist": null, "requires_python": "", "summary": "A NetworkX package which computes the edge search number of a tree", "version": "1.0.3" }, "last_serial": 3023078, "releases": { "1.0.0": [ { "comment_text": "", "digests": { "md5": "8ab7c96e8e8e644e118a8e6f34311b0d", "sha256": "4390bcaa04c25225eb03514c5743c692e7ace9a7defe0d0abf3345155ecc6b15" }, "downloads": -1, "filename": "tree_edge_search-1.0.0.zip", "has_sig": false, "md5_digest": "8ab7c96e8e8e644e118a8e6f34311b0d", "packagetype": "sdist", "python_version": "source", "requires_python": null, "size": 3702, "upload_time": "2017-07-14T13:25:54", "url": "https://files.pythonhosted.org/packages/c0/18/bd96622fa4812b3efd6409b6a96e3efa80b1fdb1cf1aa85f4a33c78f965f/tree_edge_search-1.0.0.zip" } ], "1.0.2": [ { "comment_text": "", "digests": { "md5": "56cdb5c15a455d5f6418fa000935b0f6", "sha256": "4ecb88d45017f2315ece244d2d7b993424ed8982d65c250fbecb1707478627ec" }, "downloads": -1, "filename": "tree_edge_search-1.0.2.zip", "has_sig": false, "md5_digest": "56cdb5c15a455d5f6418fa000935b0f6", "packagetype": "sdist", "python_version": "source", "requires_python": null, "size": 3701, "upload_time": "2017-07-14T13:31:54", "url": "https://files.pythonhosted.org/packages/95/04/c6b134adcf3596bd019dfd826d584fa94328c8ae241d734b109f7ec3e988/tree_edge_search-1.0.2.zip" } ], "1.0.3": [ { "comment_text": "", "digests": { "md5": "4bf836aae92951a123cee6cbdda3d2a8", "sha256": "c122a03c808e107dd7d27a33c814a33c7b234a03c51ba6635a5a3d360ba5659d" }, "downloads": -1, "filename": "tree_edge_search-1.0.3.zip", "has_sig": false, "md5_digest": "4bf836aae92951a123cee6cbdda3d2a8", "packagetype": "sdist", "python_version": "source", "requires_python": null, "size": 3701, "upload_time": "2017-07-14T13:40:23", "url": "https://files.pythonhosted.org/packages/1e/0a/97e3dc28289aa6e0ab0e7a2fa6f2a5b2ca71e38e7295c4c3338f7c950a5d/tree_edge_search-1.0.3.zip" } ] }, "urls": [ { "comment_text": "", "digests": { "md5": "4bf836aae92951a123cee6cbdda3d2a8", "sha256": "c122a03c808e107dd7d27a33c814a33c7b234a03c51ba6635a5a3d360ba5659d" }, "downloads": -1, "filename": "tree_edge_search-1.0.3.zip", "has_sig": false, "md5_digest": "4bf836aae92951a123cee6cbdda3d2a8", "packagetype": "sdist", "python_version": "source", "requires_python": null, "size": 3701, "upload_time": "2017-07-14T13:40:23", "url": "https://files.pythonhosted.org/packages/1e/0a/97e3dc28289aa6e0ab0e7a2fa6f2a5b2ca71e38e7295c4c3338f7c950a5d/tree_edge_search-1.0.3.zip" } ] }