Dijkstra's Algorithm?

C++

Forum

Forum
General C++ Programming
Dijkstra's Algorithm?

Dijkstra's Algorithm?

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

void relax(vertex *a, vertex *b)
	{
		
		if(a->distance + weightFrom(a,b) > b->distance)
			{
				b->distance = a->distance + weightFrom(a,b);
				b->pred = a;
			}
	

	}

MMhawk607 (22)

bump

as well, my output when i do a looop on deletemin is out of order, any reason why this might be?

MMhawk607 (22)

help?? :O

Topic archived. No new replies allowed.