Expand description
Replacement edge data structure for O(log n) reconnection
Provides fast lookup of replacement edges when a tree edge is deleted. Based on the level-based approach from dynamic connectivity literature.
Structs§
- Replacement
Edge Index - Level-based replacement edge index for O(log n) lookup
- Replacement
Index Stats - Statistics about the replacement edge index
Type Aliases§
- EdgeKey
- Edge identifier as (smaller, larger) vertex pair