The F# Journal just published an article about graph theory:
"Many practical problems require the ability to find or approximate the set of edges with the smallest total weight that join a graph into two separate subgraphs. This article walks through the design and implementation of a simple F# program to compute the exact min cut of an undirected weighted graph using the Stoer-Wagner algorithm..."
To read this article and more, subscribe to The F# Journal today!
Qi, Lisp and O'Caml compared - performance shootout - An old article by Mark Tarver reproduced here for historical interest: This test was conducted to determine the relative efficiency and code size of hand-c...
1 month ago