The F# Journal just published an article about visualization:
"Laying out the vertices and edges of a graph in 2D to produce an informative diagram is an important challenge in computer science. This article takes a look at an algorithm for graph layout that uses combinatorial optimisation...."
To read this article and more, subscribe to The F# Journal today!
Does reference counting really use less memory than tracing garbage collection? Mathematica vs Swift vs OCaml vs F# on .NET and Mono - Our previous post caused some controversy by questioning the validity of some commonly-held beliefs. Specifically, the beliefs that reference counting (RC)...
3 weeks ago