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.
-
Updated
Apr 29, 2023 - Java
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.
There is given an undirected graph G = (V, E) from which edges are deleted one at a time. Questions like "Are the vertices u and v in the same connected component?" have to be answered in constant time.
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.
Judycon.jl implements dynamic connectivity algorithms for Julia programming language. In computing and graph theory, a dynamic connectivity structure is a data structure that dynamically maintains information about the connected components of a graph.
Rust implementation of Link-cut-tree: self-balancing data structure to maintain a dynamic forest of (un)rooted trees.
Implementation of various algorithms in Java
Explore percolation theory with this Java-based system. Simulate fluid flow using a weighted quick-union algorithm. Ideal for understanding connectivity, it finds applications in various domains. Simple, efficient, and versatile.
This is a collection of implementation of a variety of algorithms implemented in Go. Clean and simple code to help people get started with data structures and algorithms in golang.
Add a description, image, and links to the dynamic-connectivity topic page so that developers can more easily learn about it.
To associate your repository with the dynamic-connectivity topic, visit your repo's landing page and select "manage topics."