Metadata-Version: 1.1
Name: tree_edge_search
Version: 1.0.0
Summary: A NetworkX package which computes the edge search number of a tree
Home-page: https://github.com/Jabbath/Tree-Edge-Search-Number
Author: Anton Afanassiev
Author-email: antonafana@yahoo.ca
License: MIT
Download-URL: https://github.com/Jabbath/Tree-Edge-Search-Number/archive/1.0.1.tar.gz
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).
Keywords: graph,theory,search,number,edge,pursuit,evasion,tree
Platform: UNKNOWN
Classifier: Development Status :: 5 - Production/Stable
