Naive implementation of the paper "Alternative Solutions for Continuous K Nearest Neighbor Queries in Spatial Network Databases." published by Kolahdouzan, Mohammad & Shahabi, Cyrus (2005).
To compute the edge network voronoi diagram I used the work https://github.com/sabrinadchan/nearest-L-station. My contribution to the ENVD solution of sabrinadchan are mainly refactorings. The related blog post was a tremendous help in understanding the implementation.