1 //=======================================================================
2 // Copyright 2002 Indiana University.
3 // Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
4 //
5 // Distributed under the Boost Software License, Version 1.0. (See
6 // accompanying file LICENSE_1_0.txt or copy at
7 // http://www.boost.org/LICENSE_1_0.txt)
8 //=======================================================================
9
10
11 /* Expected Output
12 0 1 2 3 4 5 6 7 8 9
13 0 0 99 111 123 103 107 125 105 111 123
14 1 99 0 12 24 4 8 26 6 12 24
15 2 111 12 0 12 16 20 24 18 24 26
16 3 123 24 12 0 28 30 12 30 26 14
17 4 103 4 16 28 0 4 22 2 8 20
18 5 107 8 20 30 4 0 18 6 4 16
19 6 125 26 24 12 22 18 0 24 14 2
20 7 105 6 18 30 2 6 24 0 10 22
21 8 111 12 24 26 8 4 14 10 0 12
22 9 123 24 26 14 20 16 2 22 12 0
23 */
24
25 #include <boost/config.hpp>
26 #include <fstream>
27 #include <iostream>
28 #include <vector>
29 #include <iomanip>
30 #include <boost/property_map/property_map.hpp>
31 #include <boost/graph/adjacency_list.hpp>
32 #include <boost/graph/graphviz.hpp>
33 #include <boost/graph/johnson_all_pairs_shortest.hpp>
34
main()35 int main()
36 {
37 using namespace boost;
38 typedef adjacency_list<vecS, vecS, undirectedS, no_property,
39 property< edge_weight_t, int,
40 property< edge_weight2_t, int > > > Graph;
41 const int V = 10;
42 typedef std::pair < int, int >Edge;
43 Edge edge_array[] =
44 { Edge(0,1), Edge(1,2), Edge(2,3), Edge(1,4), Edge(2,5), Edge(3,6),
45 Edge(4,5), Edge(5,6), Edge(4,7), Edge(5,8), Edge(6,9), Edge(7,8),
46 Edge(8,9)
47 };
48
49 const std::size_t E = sizeof(edge_array) / sizeof(Edge);
50
51 Graph g(edge_array, edge_array + E, V);
52
53
54 property_map < Graph, edge_weight_t >::type w = get(edge_weight, g);
55 int weights[] = { 99, 12, 12, 4, 99, 12, 4, 99, 2, 4, 2, 99, 12 };
56 int *wp = weights;
57
58 graph_traits < Graph >::edge_iterator e, e_end;
59 for (boost::tie(e, e_end) = edges(g); e != e_end; ++e)
60 w[*e] = *wp++;
61
62 std::vector < int >d(V, (std::numeric_limits < int >::max)());
63 int D[V][V];
64 johnson_all_pairs_shortest_paths(g, D, distance_map(&d[0]));
65
66 std::cout << std::setw(5) <<" ";
67 for (int k = 0; k < 10; ++k)
68 std::cout << std::setw(5) << k ;
69 std::cout << std::endl;
70 for (int i = 0; i < 10; ++i) {
71 std::cout <<std::setw(5) << i ;
72 for (int j = 0; j < 10; ++j) {
73 std::cout << std::setw(5) << D[i][j] ;
74 }
75 std::cout << std::endl;
76 }
77
78 return 0;
79 }
80