vrom911 / dynamicconnectivity

:chart_with_upwards_trend: Advanced Data Structures Final Project

Dynamic Connectivity

The project that implements a data structure of the dynamic connectivity in random undirected graph, which supports operations of removal and addition of edges, verification that two vertices are in the same connected component.

• void link(u, v) – add edge to the graph, operation time is
• void cut(u, v) – delete edge from the graph, the amortized time for a delete operation is
• boolean areConnected(u, v) – query to check whether two vertices are connected by a path, operation time is

License

This project is licensed under the MIT License - see the LICENSE.md file for details

Other

Report in russian