A dynamic data structure for reachability queries for temporal graphs. A quick implementation of the data structure introduced in `` A Dynamic Data Structure for Temporal Reachability with Unsorted Contact Insertions'' (https://arxiv.org/abs/2102.04187)
This project is being funded by CNPq (406418/2021-7) and FAPEMIG.
java 1.8 or newer
Compilation:
javac Rtuples.java
or
make
Testing:
make tests