Graphs --- Sample Algorithms

Steven J. Zeil

Old Dominion University, Dept. of Computer Science

Table of Contents

1. Partial Orders and the Topological Sort
1.1. Partial Orders
1.2. Topological Sort
2. Path-Finding
2.1. Shortest (unweighted) Path
3. Weighted Shortest Paths
3.1. Dijkstra's Algorithm
3.2. Analysis of Dijkstra's Algorithm
4. Minimum Spanning Trees
4.1. Prim's Algorithm

The area of graph-processing algorithms is more than large enough to devote an entire course to. In this section we'll look at just a few of the classics, which will, I hope, give you a feel for some of the common patterns shared by most graph processing.

In the Forum:

(no threads at this time)