Algorithm Search⌘K

Algorithmadvanced

Offline dynamic connectivity

Also called segment tree over time with rollback union-find, divide-and-conquer over time connectivity.

Places each edge on a segment tree over time and uses rollback union-find to answer all queries.

Places each edge on a segment tree over time and uses rollback union-find to answer all queries.

About this page

The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • the section The problem
  • pseudocode in The algorithm
  • complexity claims in the front matter
  • one source with a locator