Skip to content

lewismj/purely_functional_graph_algos

Repository files navigation

tiki

Summary

Summary

A library for functional graph algorithms.

Issues

Waffle board.

Documentation

Tiki information and documentation is available on the website. Scaladoc index.

Algorithm Example
depth & breadth first search graph
Kahn (topological sort) graph
Bellman-Ford (negative cycle detection) graph
Kruskal (minium spanning tree) graph
Kosaraju (strongly connected components) graph
Bowyer-Watson (Delaunay triangulation) graph
Euclidean distance mst graph
K-Spanning (clustering) trees graph
Markov Cluster Algorithm (MCL) graph

References

  • The Under-Appreciated Unfold 1.
  • Zippers and Data Type Derivaties 2