Module tree 

tree algorithms

Modules

centroid_decomposition 🔒

depth 🔒

distance_frequencies 🔒

euler_tour 🔒

generator 🔒

heavy_light_decomposition 🔒

level_ancestor 🔒

link_cut_tree 🔒

rerooting 🔒

dynamic programming on all-rooted trees

static_top_tree 🔒

top_tree 🔒

tree_center 🔒

tree_centroid 🔒

tree_dp 🔒

tree_hash 🔒

tree_order 🔒

xor_linked_tree 🔒

Structs

Children

ContourQueryRange

DfsPreorder

HeavyLightDecomposition

HeavyLightPathFold

LevelAncestor

LinkCutTree

A link-cut forest with stable insertion-order node identifiers.

LowestCommonAncestor

MixedTree

NoTopTreeAction

PathTree

PruferSequence

Generate Tree with Prüfer sequence

ReRooting

dynamic programming on all-rooted trees

StarTree

StaticTopTree

StaticTopTreeDp

TopTree

A self-adjusting top tree, also called a strong link-cut tree.

TreeHasher

XorLinkedRootedTree

XorLinkedRootedTreeBuilder

XorLinkedRootedTreeScanner

Enums

EIndexed

NoDepth

NoDfsPreorder

NoEIndexed

NoEdgeChild

NoParent

NoParentEdge

NoXorBottomUpOrder

RecordDepth

RecordDfsPreorder

RecordEdgeChild

RecordParent

RecordParentEdge

RecordXorBottomUpOrder

TreeCenter

Traits

BuildXorBottomUpOrder

Cluster

DepthComponent

DfsPreorderComponent

EdgeChildComponent

LinkCutTreePathFold

LinkCutTreePathUpdate

LinkCutTreeSpec

LinkCutTreeSubtreeFold

LinkCutTreeSubtreeUpdate

Pending updates must be propagated through top_down, attach_virtual, detach_virtual, and transfer_path_parent.

MonoidCluster

ParentComponent

ParentEdgeComponent

TopTreeAction

act_path applies the heavy contribution and act_path_light applies the light contribution represented in the same path aggregate.

TopTreeSpec

compress must be associative and rake must be associative and commutative. reverse must be an involution and reverse the operand order of compress.

XorBottomUpOrderBuffer

XorBottomUpOrderComponent

Type Aliases

PathLinkCutTree

L::act_agg must return Some for every action.