Skip to content

Data structure for dynamic connectivity in undirected graphs. Supports adding and removing edges and checking whether two vertices are connected (there's a path between them) in polylogarithmic time.

License

Notifications You must be signed in to change notification settings

leijurv/dynamic-connectivity

 
 

Repository files navigation

About

Data structure for dynamic connectivity in undirected graphs. Supports adding and removing edges and checking whether two vertices are connected (there's a path between them) in polylogarithmic time.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Languages

  • Java 100.0%