// Global arrays indexed by vertex number int[] dist // dist[u] = distance from s to u
// Global arrays indexed by vertex number int[] dist // dist[u] = distance from s to u int[] prev // prev[u] = u’s predecessor in BFS tree // Dijkstra’s alg. for G = (V,E), starting at vertex s. void dijkstra (G, s) for each u in V dist[u] = prev[u] = null
116 views • 2 slides