Dijkstra算法完整实现源代码.docVIP

Dijkstra算法的完整实现版本，算法的源代码 /* Dijkstra.c Copyright (c) 2002, 2006 by ctu_85 All Rights Reserved. */ #include stdio.h #include malloc.h #define maxium 32767 #define maxver 9 /*defines the max number of vertexs which the programm can handle*/ #define OK 1 struct Point { char vertex[3]; struct Link *work; struct Point *next; }; struct Link { char vertex[3]; int value; struct Link *next; }; struct Table /*the workbannch of the algorithm*/ { int cost; int Known; char vertex[3]; char path[3]; struct Table *next; }; int Dijkstra(struct Point *,struct Table *); int PrintTable(int,struct Table *); int PrintPath(int,struct Table *,struct Table *); struct Table * CreateTable(int,int); struct Point * FindSmallest(struct Table *,struct Point *);/*Find the vertex which has the smallest value reside in the table*/ int main() { int i,j,num,temp,val; char c; struct Point *poinpre,*poinhead,*poin; struct Link *linpre,*linhead,*lin; struct Table *tabhead; poinpre=poinhead=poin=(struct Point *)malloc(sizeof(struct Point)); poin-next=NULL; poin-work=NULL; restart: printf(Notice:if you wanna to input a vertex,you must use the format of number!\n); printf(Please input the number of points:\n); scanf(%d,num); if(nummaxver||num1||num%1!=0) { printf(\nNumber of points exception!); goto restart; } for(i=0;inum;i++) { printf(Please input the points next to point %d,end with 0:\n,i+1); poin=(struct Point *)malloc(sizeof(struct Point)); poinpre-next=poin; poin-vertex[0]=v; poin-vertex[1]=0+i+1; poin-vertex[2]=\0; linpre=lin=poin-work; linpre-next=NULL; for(j=0;jnum-1;j++) { printf(The number of the %d th vertex linke