Implementation for the paper Reactive Proximity Data Structures for Graphs
This project considers the classic question of finding nearest neighbors, but in a graph-based setting where the objects of interest are nodes in a graph and we are interested in shortest-path distance as opposed to Euclidean or some other geometric distance. It implements a data structure that maintains a subset of the nodes of a graph, called sites, and allow the following operations:
- Updates: add or remove a node from the set of sites.
- Queries: given a query node, return the closest site to the query node.
The data structure is based on a separator hierarchy.