Skip to main content

A NetworkX package which computes the edge search number of a tree

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

Project details

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Files for tree-edge-search, version 1.0.3
Filename, size File type Python version Upload date Hashes
Filename, size (3.7 kB) File type Source Python version None Upload date Hashes View

Supported by

Pingdom Pingdom Monitoring Google Google Object Storage and Download Analytics Sentry Sentry Error logging AWS AWS Cloud computing DataDog DataDog Monitoring Fastly Fastly CDN DigiCert DigiCert EV certificate StatusPage StatusPage Status page