The F# Journal just published an article about graph algorithms:
"Kruskal's algorithm for computing the minimum spanning tree of a weighted undirected graph uses the union-find data structure to combine fragments of tree connected by the lightest edges. This article describes both pure and impure implementations of the algorithm using the persistent union-find data structure by Conchon and Filliâtre to create a high performance purely functional solution..."
To read this article and more, subscribe to The F# Journal today!
Harrop's Tenth Rule - I was just reading one of the many self-soothing essays from the Lisp community and remembered my parody of Greenspun's Tenth Rule: "Any sufficiently compl...
1 day ago