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!
Why does Java still feel bloated nowadays compared to other languages with garbage collection? - "We were after the C++ programmers. We managed to drag a lot of them about halfway to Lisp." -- Guy Steele. The fundamental problem with Java is that Lisp ...
3 months ago