Struct EulerTourTree 

pub struct EulerTourTree { /* private fields */ }

Euler Tour Tree for maintaining dynamic connectivity

Supports O(log n) link, cut, and connectivity queries

Implementations

impl EulerTourTree

pub fn new() -> Self

Create a new Euler Tour Tree

pub fn add_vertex(&mut self, v: u32)

Add a vertex (if not already present)

pub fn link(&mut self, u: u32, v: u32) -> Result<(), DynamicMinCutError>

Link two vertices with an edge

Time: O(log n) amortized via splay operations

pub fn cut(&mut self, u: u32, v: u32) -> Result<(), DynamicMinCutError>

Cut an edge between two vertices

Time: O(log n) amortized

pub fn connected(&self, u: u32, v: u32) -> bool

Check if two vertices are connected

Time: O(log n) - find roots and compare

pub fn component_size(&self, v: u32) -> usize

Get component size containing vertex v

Time: O(log n)

Trait Implementations

impl Default for EulerTourTree

fn default() -> Self

Returns the “default value” for a type.