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!
What languages did you learn, in what order? - I once compiled the following list of programming languages and which year I started learning them: - 1981: Sinclair BASIC (on a ZX81) - 1983: BBC BA...
2 weeks ago