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!
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