Tuesday, 19 October 2010
Graph algorithms: topological sort and all-pairs shortest paths
The F#.NET Journal just published an article about graph theory:
"Following on from our previous article about depth- and breadth-first searches of graphs, this article examines some more involved algorithms that also have many practical applications. A topological sort of a directed acyclic graph produces the vertices in a sequence where every vertex reachable from another appears after it in the sequence. All-pairs shortest paths finds the shortest path from any vertex to any other vertex..."
To read this article and more, subscribe to The F#.NET Journal today!
Subscribe to Posts [Atom]