Module outils::tree
[−]
[src]
Tree data structures and algorithms
Modules
bst |
Binary tree data structures and algorithms |
traversal |
Tree traversal iterators over node indices, node values or both at the same time. In order for
a tree data structure to support these iterators, the |
Traits
WeightedTree |
Trees implementing this trait are able to maintain node weights and subweights. The subweight of a tree node is recursively defined as the sum of its own weight plus the subweights of its children. The subweight of a leaf node is equal to its weight. |