dijkstra算法(数据结构:链式前向星)

#include <iostream>
#include <queue>
#include <vector>
#include <cstring>
#include <fstream>

using namespace std;
const int INF  = 0x3f3f3f3f;
const int maxn = 1005;

struct Edge
{
	int to;		//边的尾点
	int w;		//边权值
	int next;	//指向上一条边 
	
} edge[maxn]; 

int v, e, cnt, head[maxn], parent[maxn], dist[maxn], visited[maxn];

typedef pair<int, int> iPair;


void inti()
{
	memset(head, -1, sizeof(head));
	memset(dist, INF, sizeof(dist));
	memset(parent, 0, sizeof(parent));
	memset(visited, 0, sizeof(visited));
}

void addEdge(int from, int to, int w)
{
	edge[cnt].to = to;		
	edge[cnt].w  = w;
	edge[cnt].next = head[from];
	head[from] = cnt++;
}


void dijkstra(int from){
     
        //优先队列准备, 小顶堆 
        priority_queue< iPair, vector <iPair> , greater<iPair> > pq;
       
        //from->from距离为0;
		//first表距离, second表始点 
        pq.push(make_pair(0,from));
        
        //from->from 距离为0 
        dist[from] = 0;
		
		//from的parent为-1 
        parent[from] = -1;
 
 		//当队列不为空时候进行循环 
        while(!pq.empty()){
          
          	//每放入一次即为当前确定的顶点,距离为最小值
			//visited[]必须置为1 
            from = pq.top().second;
            visited[from] = 1;
            pq.pop(); 
            
            //寻找邻接点 
            for(int i = head[from]; ~i; i = edge[i].next){

              if(!visited[edge[i].to]){
             
              int v = edge[i].to;
              int weight = edge[i].w;
			
			//如果dis[v]的值大于from到v的值，更新parent以及dist
			//将新信息放入优先队列中 
              if(dist[v] > dist[from] + weight){ 
                parent[v] = from;
                dist[v] = dist[from] + weight;
                pq.push(make_pair(dist[v], v));
              }
            }   
        }
      }
}

void printAllPath()
{
	dijkstra(1);
	
	for(int i = v; i >= 1; i--)
	{
		cout << i << " ";
		for(int j = parent[i]; j != -1; j = parent[j])
		{
			cout  << j <<" ";
		}
		cout << endl;
	}
}

int main()
{
	inti();
	ifstream in("graph.txt", ios::in);
	in >> v >> e;
	
	int from, to, w;
	for(int i = 0; i < e; i++)
	{
		in >> from >> to >> w;
		addEdge(from, to, w);
	}
	
	printAllPath();

	return 0;
}

基于链式前向星的dijkstra, 用优先队列进行了优化，代码关键一点，visited位置，一定是进入了已排好序的集合中才能是访问过。测试数据，可以使用上一篇链式前向星使用过的数据。