dijkstra.h

来自「how to finding the best way from A to B」· C头文件 代码 · 共 33 行

//-----------------------------------------------------
#include "stdio.h"
#include "conio.h"
#define MAX 100

//-----------------------------------------------------
typedef struct {
		int n; // so dinh cua do thi
		int a[MAX][MAX]; // ma tran ke
}GRAPH;
typedef struct
{
	int dinh;
	int lenght;
	int post;
	int label;
}info;
typedef struct Q
{
	info a[MAX];
	int top;				// so phan tu cua queue
}Stack;
//-----------------------------------------------------
int Push(Stack &, info );
int Pop(Stack &, info &);
void InitStack(Stack &);
int Empty(const Stack & );
void Init(GRAPH ,int , int [],int [],int []);
void DocMaTranKe(char *, GRAPH &,int &,int &);
void XuatFile(char * ,bool ,int  ,int  ,int  ,int  []);
void XuatNguoc(FILE *,int ,int []);
void DijkstraAlg(GRAPH  ,int  [],int  [],int  [],int  ,int  );