You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
|
|
## TODO
|
|
|
|
|
|
|
|
|
|
* [x] more complete functions and aggregations
|
|
|
|
|
* [ ] more complete tx tests
|
|
|
|
|
* [ ] graph algorithms
|
|
|
|
|
* [x] bfs
|
|
|
|
|
* [x] dfs
|
|
|
|
|
* [x] shortest path
|
|
|
|
|
* [x] A*
|
|
|
|
|
* [x] Yen's k-shortest
|
|
|
|
|
* [x] all-pairs shortest path
|
|
|
|
|
* [x] single-source shortest path
|
|
|
|
|
* [x] minimum spanning tree
|
|
|
|
|
* [ ] random walking
|
|
|
|
|
* [x] degree centrality
|
|
|
|
|
* [x] closeness centrality
|
|
|
|
|
* [x] betweenness centrality
|
|
|
|
|
* [x] pagerank
|
|
|
|
|
* [ ] triangle counting
|
|
|
|
|
* [x] strongly connected components
|
|
|
|
|
* [x] connected components
|
|
|
|
|
* [ ] label propagation
|
|
|
|
|
* [ ] louvain modularity
|
|
|
|
|
* [x] direct loading of data
|
|
|
|
|
* [ ] serial agg function
|
|
|
|
|
* [ ] random function
|
