https://github.com/vrom911/dynamicconnectivity

:chart_with_upwards_trend: Advanced Data Structures Final Project
https://github.com/vrom911/dynamicconnectivity

advanced-data-structures dynamic-connectivity-problem graph

Last synced: about 1 year ago
JSON representation

:chart_with_upwards_trend: Advanced Data Structures Final Project

• Host: GitHub
• URL: https://github.com/vrom911/dynamicconnectivity
• Owner: vrom911
• License: mit
• Created: 2016-12-28T01:49:47.000Z (over 9 years ago)
• Default Branch: master
• Last Pushed: 2017-06-24T09:08:31.000Z (almost 9 years ago)
• Last Synced: 2025-03-28T11:21:17.180Z (about 1 year ago)
• Topics: advanced-data-structures, dynamic-connectivity-problem, graph
• Language: Java
• Homepage:
• Size: 263 KB
• Stars: 5
• Watchers: 1
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# 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 ![equation](http://latex.codecogs.com/png.latex?O(\log&space;&space;n))

- `void cut(u, v)` – delete edge from the graph, the amortized time for a delete operation is ![equation](http://latex.codecogs.com/png.latex?O(\log{}^2&space;n))

- `boolean areConnected(u, v)` – query to check whether two vertices are connected by a path, operation time is ![equation](http://latex.codecogs.com/png.latex?O(\log&space;&space;n))

## License

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

## Other

[Report](https://github.com/vrom911/DynamicConnectivity/blob/master/Romashkina_M4138_DynamicConnectivity.pdf) in russian