20.boost dijkstra最短路径算法

到某个点的最短距离                到终点的最短路径

完整代码

#include <iostream>
#include <string>
#include <utility>
#include <vector>
#include <deque>
#include <boost/graph/adjacency_list.hpp>
//A*寻路算法
#include <boostgraphastar_search.hpp>
#include <boostgraphdijkstra_shortest_paths.hpp>
using namespace std;
using namespace boost;


void main()
{
    //定义图的种类
    typedef adjacency_list<listS, vecS, directedS, no_property, property<edge_weight_t, double>> graph_t;
    //定义相关类型
    typedef graph_traits<graph_t>::vertex_descriptor vertex_desciptor;
    typedef graph_traits<graph_t>::edge_descriptor edge_descriptor;
    typedef pair<int, int> Edge;

    //定义结点和边的相关对象和属性
    enum nodes { A, B, C, D, E, F, G, H, N };
    char name[] = "ABCDEFGH";
    //创建边
    Edge edge_array[] = { Edge(A,B),Edge(A,C),Edge(B,D),Edge(B,E),Edge(C,E),
    Edge(C,F),Edge(F,G),Edge(G,H),Edge(E,H),Edge(D,E),Edge(D,H) };
    //定义边的权重
    double weights[] = { 5,1,1.3,3,10,2,1.2,0.5,1.3,0.4,6.3 };
    //边的数量
    int num_arcs = sizeof(edge_array) / sizeof(Edge);

    //生成被建模的图对象
    //     边数组头地址      边数组尾地址       定义权重     结点数量
    graph_t g(edge_array, edge_array + num_arcs, weights,       N);

    //p用于放置最短路径生成树的各个顶点的下一个节点
    std::vector<vertex_desciptor> p(num_vertices(g));
    //d用于放置从近到远的路径距离
    std::vector<double> d(num_vertices(g));
    //待求最短路径的源顶点
    vertex_desciptor s = vertex(A, g);

    //对图g的A顶点(s为它的描述器,即从哪个点开始)应用dijkstra算法
    //作为结果的距离矢量保存在d数组中
    //最短路径树上的父节点保存在p数组中
    dijkstra_shortest_paths(g, s, predecessor_map(&p[0]).distance_map(&d[0]));
    std::cout << "最短路径延时(ms)" << "	最短路径树的父节点:" << std::endl;
    //输出结果到屏幕
    graph_traits <graph_t>::vertex_iterator vi, vend;
    for (tie(vi, vend) = vertices(g); vi != vend; vi++)
    {
        std::cout << "路径距离(" << name[*vi] << ") = " << d[*vi] << ",	";
        std::cout << "父节点(" << name[*vi] << ") = " << name[p[*vi]] << endl;
    }
    cout << endl;
    system("pause");
}