azizkayumov/lctree
Rust implementation of Link-cut-tree: self-balancing data structure to maintain a dynamic forest of (un)rooted trees.
RustApache-2.0
Issues
- 0
Random test for `remove_tree`
#53 opened by azizkayumov - 0
Aggregate subtree information
#52 opened by azizkayumov - 0
Cache `findroot(v)`
#50 opened by azizkayumov - 1
Add coverage
#45 opened by azizkayumov - 0
Default constructor to create `n` nodes
#38 opened by azizkayumov - 0
Benchmarks
#41 opened by azizkayumov - 1
Include memory usage in benchmarks
#39 opened by azizkayumov - 6
Delete node
#35 opened by azizkayumov - 0
Fix benchmarks: allow invalid cut operations
#36 opened by azizkayumov - 0
Add / delete nodes
#25 opened by azizkayumov - 4
Implement lca(v, w)
#17 opened by azizkayumov - 1
General path aggregates
#6 opened by azizkayumov - 0
Preliminaries
#29 opened by azizkayumov - 0
Check invalid cut operations
#31 opened by azizkayumov - 0
Benchmarks against brute-force
#28 opened by azizkayumov - 0
Implement findmax(v,w)
#14 opened by azizkayumov - 3
Link non-root nodes
#19 opened by azizkayumov - 0
Assertions on node_idx out of bounds
#18 opened by azizkayumov - 0
Implement findroot(v)
#20 opened by azizkayumov - 0
Add stress tests
#12 opened by azizkayumov - 0
Implement "Cut"
#5 opened by azizkayumov - 0
Implement "Link"
#4 opened by azizkayumov - 0
Implement "Connected"
#3 opened by azizkayumov - 0
Implement "Access"
#2 opened by azizkayumov - 0
Implement "Splay"
#1 opened by azizkayumov