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!
Background reading on the reference counting vs tracing garbage collection debate - Eight years ago I answered a question on Stack Overflow about the suitability of OCaml and Haskell for soft real-time work like visualization: "*for real-ti...
6 months ago