#include "bfs.h"
#include "dijkstra.h"
#include <limits.h>
#include <stdlib.h>

Include dependency graph for dijkstra.c:

Data Structures
struct	heap
Defines
#define	MAX_DIST (double)INT_MAX
#define	LOOP while(TRUE)
#define	left(i) (2*(i))
#define	right(i) (2*(i)+1)
#define	parent(i) ((i)/2)
#define	insideHeap(h, i) ((i)<h->heapSize)
#define	greaterPriority(h, i, j, dist) (dist[h->data[i]]<dist[h->data[j]])
#define	assign(h, i, j, index) {h->data[i]=h->data[j]; index[h->data[i]]=i;}
#define	exchange(h, i, j, index)
Typedefs
typedef DistType	Word
Functions
void	dijkstra (int vertex, vtx_data graph, int n, DistType dist)
int	dijkstra_bounded (int vertex, vtx_data graph, int n, DistType dist, int bound, int *visited_nodes)
void	dijkstra_f (int vertex, vtx_data graph, int n, float dist)

Define Documentation

#define assign	(	h,
		i,
		j,
		index
	)	{h->data[i]=h->data[j]; index[h->data[i]]=i;}

Definition at line 45 of file dijkstra.c.

#define exchange	(	h,
		i,
		j,
		index
	)

Value:

{int temp; \
                temp=h->data[i]; \
                h->data[i]=h->data[j]; \
                h->data[j]=temp; \
                index[h->data[i]]=i; \
                index[h->data[j]]=j; \
}

Definition at line 46 of file dijkstra.c.