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.
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.
Write a program to estimate the value of the percolation threshold via Monte Carlo simulation.
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.
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."