graphknn (pypi): For every vertex in a graph, this code efficiently finds its K nearest vertices from a particular subset of "special" vertices.
Keywords: graph|knn|dijkstra|shortest|path