PyPI page
Home page
Author:
Amit Moscovich
License:
MIT
Summary:
For every vertex in a graph, this code efficiently finds its K nearest vertices from a particular subset of "special" vertices.
Latest version:
1.0.0b1
Required dependencies:
heapdict
|
scipy
Downloads last day:
2
Downloads last week:
6
Downloads last month:
12