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).
Release history Release notifications | RSS feed
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 details)
File details
Details for the file tree_edge_search-1.0.3.zip.
File metadata
- Download URL: tree_edge_search-1.0.3.zip
- Upload date:
- Size: 3.7 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | c122a03c808e107dd7d27a33c814a33c7b234a03c51ba6635a5a3d360ba5659d |
|
| MD5 | 4bf836aae92951a123cee6cbdda3d2a8 |
|
| BLAKE2b-256 | 1e0a97e3dc28289aa6e0ab0e7a2fa6f2a5b2ca71e38e7295c4c3338f7c950a5d |
