## 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
  * [ ] all-pairs shortest path
  * [x] single-source shortest path
  * [x] minimum spanning tree
  * [ ] random walking
  * [x] degree centrality
  * [ ] closeness centrality
  * [ ] betweenness centrality
  * [ ] pagerank
  * [ ] triangle counting
  * [x] strongly connected components
  * [x] connected components
  * [ ] label propagation
  * [ ] louvain modularity
* [x] direct loading of data