最短路径算法Dijkstra-HongweiDong董洪伟.PDFVIP

最短路径算法最短路径算法 Dijkstra 最短路径算法最短路径算法 一、 图的邻接表存储结构及实现（回顾） 1．． 头文件头文件 graph.h ．． 头文件头文件 // Graph.h: interface for the Graph class. #if !defined(AFX_GRAPH_H__C891E2F0_794B_4ADD_8772_55BA3 67C823E__INCLUDED_) #define AFX_GRAPH_H__C891E2F0_794B_4ADD_8772_55BA367C823E__I NCLUDED_ Copy right by Hongwei Dong () #if _MSC_VER 1000 #pragma once #endif // _MSC_VER 1000 #include cassert #include vector using namespace std; #define NULL 0 typedef int weightType; typedef char Type; //数据元素类型 class EdgeNode { // A singly-linked list node public: weightType weight; // Edge weight int v1; // Vertex edge comes from int v2; // Vertex edge goes to EdgeNode* next; // Pointer to next edge in list EdgeNode(int vt1, int vt2, weightType w, EdgeNode* nxt =NULL) { v1 = vt1; v2 = vt2; weight = w; next = nxt; } // Constructor EdgeNode(EdgeNode* nxt =NULL) { next = nxt; } // Constructor }; Copy right by Hongwei Dong () typedef EdgeNode* Edge; struct VertexNode { Type data; Edge first; VertexNode(Type d,Edge e):data(d),first(e){} }; typedef VertexNode Vertex; class Graph { // Graph class: Adjacency list private : vectorVertex list; //The vertex list int numEdge; // Number of edges vectorbool Mark; // The mark array public : Graph();