dynamic-connectivity

There are 9 repositories under dynamic-connectivity topic.

  • btrekkie/dynamic-connectivity

    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.

    Language:Java20433

  • rafaelglikis/dynamic-connectivity

    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.

    Language:C++10200

  • ahojukka5/Judycon.jl

    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.

    Language:Julia521

  • leijurv/dynamic-connectivity

    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.

    Language:Java4000

  • azizkayumov/lctree

    Rust implementation of Link-cut-tree: self-balancing data structure to maintain a dynamic forest of (un)rooted trees.

    Language:Rust21250

  • apoorvam/algorithms

    Implementation of various algorithms in Java

    Language:Java1303

  • orifjon9/Algorithms

    Language:C#1200

  • KhaledEkramy/Percolation-System-GUI

    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.

    Language:Java10

  • lovesaroha/Algorithms-Go

    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.

    Language:Go10