数据结构------图 D单源最短路 Dijstra算法

void DshortedPath(const int v)
{
	int u, k;
	int max = 10000;
	Edge *p;
	int n = graphsize;
	int* path = new int[graphsize];
	int* dist = new int[graphsize];
	int* s = new int[n];
	//数组s记录i是否被访问过
	for (int i = 0;i < n;i++)//path dist s 初始化
	{
		path[i] = -1;
		dist[i] = max;
		s[i] = 0;
	}
	dist[v] = 0;
	s[v] = 1;
	//初始顶点v的数组值
	p = Head[v].adjacent;
	u = v;
	//u为即将访问的顶点
	for (int j = 0;j < n;j++)
	{
		//循环2 ：修改u邻接顶点的s[]值，path值和dist[]值
		while (p != NULL)
		{
			k = p->VerAdj;
			if (s[k] != 1 && dist[u] + p->cost < dist[k])
			{
				dist[k] = dist[u] + p->cost;
				path[k] = u;
			}
			p = p->link;
		}
		//循环3 确定即将被访问的结点u
		int ldist = max;
		for (i = 0;i < n;i++)
		{
			if (dist[i] > 0 && dist[i] < ldist&&s[i] == 0)
			{
				ldist = dist[i];
				u = i;
			}
		}
		s[u] = 1;//访问u
		p = Head[u].adjacent;//p为u的边链表的头指针
	}
	for (i = 0;i < n;i++)
		cout << path[i] << " ";
	for (i = 0;i < n;i++)
		cout << dist[i] << " ";
	delete[]path;
	delete[]dist;

}