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).
1 maintainer
Metadata
1 maintainer
Release files for tree-edge-search 1.0.3
For a detailed explanation of source distributions (sdists) and built distributions (wheels), please see the package formats documentation.
Source distribution (sdist)
| File | Size | Uploaded | |
|---|---|---|---|
| tree_edge_search-1.0.3.zip | 3.7 kB | Details |
Release files / tree_edge_search-1.0.3.zip
| Download URL | tree_edge_search-1.0.3.zip |
|---|---|
| Size | 3.7 kB |
| Tags | Source |
|
SHA-256 checksum How to use checksums |
c122a03c808e107dd7d27a33c814a33c7b234a03c51ba6635a5a3d360ba5659d
|
|
BLAKE2b-256 checksum How to use checksums |
1e0a97e3dc28289aa6e0ab0e7a2fa6f2a5b2ca71e38e7295c4c3338f7c950a5d
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
No |
