A NetworkX package which computes the edge search number of a tree
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).
|Filename, size||File type||Python version||Upload date||Hashes|
|Filename, size tree_edge_search-1.0.3.zip (3.7 kB)||File type Source||Python version None||Upload date||Hashes View hashes|