stefiosif/reachability-algorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update README

Browse Source
This commit is contained in:
Stefanos Iordanis Iosifidis
2023-03-08 22:40:25 +02:00
committed by GitHub
parent 80f8a00a24
commit f5b48bbafd
1 changed files with 2 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
README.md
View File

@@ -1,15 +1,7 @@
# Reachability algorithms by Roditty and Zwick
The goal of this project is to implement a collection of dynamic reachability
algorithms covered in "Improved Dynamic Reachability Algorithms for Directed Graphs"
The goal of this repository is to implement a collection of decremental/dynamic reachability
algorithms, inspired by "Improved Dynamic Reachability Algorithms for Directed Graphs"
by Liam Roditty and Uri Zwick.
In more detail, the algorithms implemented, include a decremental reachability
algorithm for the transitive closure of a directed acyclic graph, a decremental
reachability algorithm for the transitive closure of a general directed graph, a
dynamic reachability algorithm of a directed acyclic graph and a dynami reachability
algorithm of a general directed graph.
The core algorithm of Roditty and Zwick is a decremental reachability algorithm for
the strongly connected components of the general directed graph, on which all
reachability algorithms for general directed graphs are based.
## A code example
```cpp
@@ -51,8 +43,5 @@ git clone --recurse-submodules https://github.com/stefiosif/dynamic-reachability
cd dynamic-reachability-algorithms
```
# Benchmark
## References
* [Improved Dynamic Reachability Algorithms for Directed Graphs](https://ieeexplore.ieee.org/document/1181993)