Skip to main content
. 2005 Aug 15;6:203. doi: 10.1186/1471-2105-6-203

Figure 8.

Figure 8

Modified Dijkstra-Prim MST algorithm. The algorithm starts with vertex s (peak-list) belonging to the peak-list pair with smallest distance (line 1) (the standard algorithm starts with an arbitrary pair). In addition to computing the MST T, the algorithm computes the calibration constants C(v, s) (line 8) and the connection weight W(u) (line 9).