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

Navigation

Verified details

These details have been verified by PyPI
Maintainers
Avatar for jabbath from gravatar.com jabbath

Unverified details

These details have not been verified by PyPI
Project links
GitHub Statistics

View statistics for this project via Libraries.io, or by using our public dataset on Google BigQuery

Meta

License: MIT

Author: Anton Afanassiev

Tags graph, theory, search, number, edge, pursuit, evasion, tree

Classifiers

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

Verified details

These details have been verified by PyPI
Maintainers
Avatar for jabbath from gravatar.com jabbath

Unverified details

These details have not been verified by PyPI
Project links
GitHub Statistics

View statistics for this project via Libraries.io, or by using our public dataset on Google BigQuery

Meta

License: MIT

Author: Anton Afanassiev

Tags graph, theory, search, number, edge, pursuit, evasion, tree

Classifiers

Release history Release notifications | RSS feed

This version

1.0.3

1.0.2

1.0.0

Download files

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

Source Distribution

tree_edge_search-1.0.3.zip (3.7 kB view hashes)

Uploaded Source

Supported by

AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page