Skip to content

lewismj/purely_functional_graph_algos

Folders and files

NameName
Last commit message
Last commit date

Latest commit

f92f77e · Apr 22, 2019
Apr 22, 2019
Oct 5, 2017
Apr 6, 2017
Oct 5, 2017
Mar 10, 2017
Mar 13, 2017
Apr 22, 2019
Mar 9, 2017
May 2, 2017
Apr 22, 2019
Apr 26, 2017
Apr 22, 2019

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