An implementation of a minimum spanning tree calculation algorithm based on Kruskal's algorithm
2 people like thisPosted: 10 years ago by Faisal Waris
How you can programmatically use GraphViz from F#.
8 people like thisPosted: 7 years ago by Tuomas Hietanen
Implements a simple algorithm to compute the transitive reduction of a graph. The transitive reduction of a graph is the minimal set of edges with the same transitive closure
0 people like thisPosted: 7 years ago by Jose Iborra