Code:void Dijkstra(int s,int t) { vertex *verts = findVertex(grid[s][t]); Heap H; for each(vertex *v in vertexList) { if(v->data == verts->data) { verts->distance = 0; verts->pred = NULL; } v->distance = INFINITY; v->pred = NULL; H.insert(v->data); } while(H.size() != 0) { vertex *x = findVertex(H.deletemin()); for each(edge *v in x->adjacencyList) { if(v->end->visited != true) { relax(x,v->end); v->end->visited = true; } else break; } } }
is something missing in my dijkstra's, i keep getting an infinite loop. never implemented dijkstra's before so i'm kinda sketchy on how to do it.
my relax function
Code:void relax(vertex *a, vertex *b) { if(a->distance + weightFrom(a,b) > b->distance) { b->distance = a->distance + weightFrom(a,b); b->pred = a; } }
