skip to navigation
skip to content

tree-edge-search 1.0.3

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).

File Type Py Version Uploaded on Size (md5) Source 2017-07-14 3KB