sl@0: //=======================================================================
sl@0: // Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee, 
sl@0: //
sl@0: // Distributed under the Boost Software License, Version 1.0. (See
sl@0: // accompanying file LICENSE_1_0.txt or copy at
sl@0: // http://www.boost.org/LICENSE_1_0.txt)
sl@0: //=======================================================================
sl@0: 
sl@0: /*
sl@0:  * © Portions copyright (c) 2006-2007 Nokia Corporation.  All rights reserved.
sl@0: */
sl@0: 
sl@0: 
sl@0: #include <boost/config.hpp>
sl@0: #include <iostream>
sl@0: #include <fstream>
sl@0: 
sl@0: #include <boost/graph/graph_traits.hpp>
sl@0: #include <boost/graph/adjacency_list.hpp>
sl@0: #include <boost/graph/dijkstra_shortest_paths.hpp>
sl@0: 
sl@0: #ifdef __SYMBIAN32__
sl@0: #include "std_log_result.h"
sl@0: #define LOG_FILENAME_LINE __FILE__, __LINE__
sl@0: #endif
sl@0: 
sl@0: 
sl@0: 
sl@0: using namespace boost;
sl@0: 
sl@0: int
sl@0: main(int, char *[])
sl@0: {
sl@0:   typedef adjacency_list < listS, vecS, directedS,
sl@0:     no_property, property < edge_weight_t, int > > graph_t;
sl@0:   typedef graph_traits < graph_t >::vertex_descriptor vertex_descriptor;
sl@0:   typedef graph_traits < graph_t >::edge_descriptor edge_descriptor;
sl@0:   typedef std::pair<int, int> Edge;
sl@0: 
sl@0:   const int num_nodes = 5;
sl@0:   enum nodes { A, B, C, D, E };
sl@0:   char name[] = "ABCDE";
sl@0:   Edge edge_array[] = { Edge(A, C), Edge(B, B), Edge(B, D), Edge(B, E),
sl@0:     Edge(C, B), Edge(C, D), Edge(D, E), Edge(E, A), Edge(E, B)
sl@0:   };
sl@0:   int weights[] = { 1, 2, 1, 2, 7, 3, 1, 1, 1 };
sl@0:   int num_arcs = sizeof(edge_array) / sizeof(Edge);
sl@0: #if defined(BOOST_MSVC) && BOOST_MSVC <= 1300
sl@0:   graph_t g(num_nodes);
sl@0:   property_map<graph_t, edge_weight_t>::type weightmap = get(edge_weight, g);
sl@0:   for (std::size_t j = 0; j < num_arcs; ++j) {
sl@0:     edge_descriptor e; bool inserted;
sl@0:     tie(e, inserted) = add_edge(edge_array[j].first, edge_array[j].second, g);
sl@0:     weightmap[e] = weights[j];
sl@0:   }
sl@0: #else
sl@0:   graph_t g(edge_array, edge_array + num_arcs, weights, num_nodes);
sl@0:   property_map<graph_t, edge_weight_t>::type weightmap = get(edge_weight, g);
sl@0: #endif
sl@0:   std::vector<vertex_descriptor> p(num_vertices(g));
sl@0:   std::vector<int> d(num_vertices(g));
sl@0:   vertex_descriptor s = vertex(A, g);
sl@0: 
sl@0: #if defined(BOOST_MSVC) && BOOST_MSVC <= 1300
sl@0:   // VC++ has trouble with the named parameters mechanism
sl@0:   property_map<graph_t, vertex_index_t>::type indexmap = get(vertex_index, g);
sl@0:   dijkstra_shortest_paths(g, s, &p[0], &d[0], weightmap, indexmap, 
sl@0:                           std::less<int>(), closed_plus<int>(), 
sl@0:                           (std::numeric_limits<int>::max)(), 0,
sl@0:                           default_dijkstra_visitor());
sl@0: #else
sl@0:   dijkstra_shortest_paths(g, s, predecessor_map(&p[0]).distance_map(&d[0]));
sl@0: #endif
sl@0: 
sl@0:   std::cout << "distances and parents:" << std::endl;
sl@0:   graph_traits < graph_t >::vertex_iterator vi, vend;
sl@0:   for (tie(vi, vend) = vertices(g); vi != vend; ++vi) {
sl@0:     std::cout << "distance(" << name[*vi] << ") = " << d[*vi] << ", ";
sl@0:     std::cout << "parent(" << name[*vi] << ") = " << name[p[*vi]] << std::
sl@0:       endl;
sl@0:   }
sl@0:   std::cout << std::endl;
sl@0: 
sl@0:   std::ofstream dot_file("figs/dijkstra-eg.dot");
sl@0: 
sl@0:   dot_file << "digraph D {\n"
sl@0:     << "  rankdir=LR\n"
sl@0:     << "  size=\"4,3\"\n"
sl@0:     << "  ratio=\"fill\"\n"
sl@0:     << "  edge[style=\"bold\"]\n" << "  node[shape=\"circle\"]\n";
sl@0: 
sl@0:   graph_traits < graph_t >::edge_iterator ei, ei_end;
sl@0:   for (tie(ei, ei_end) = edges(g); ei != ei_end; ++ei) {
sl@0:     graph_traits < graph_t >::edge_descriptor e = *ei;
sl@0:     graph_traits < graph_t >::vertex_descriptor
sl@0:       u = source(e, g), v = target(e, g);
sl@0:     dot_file << name[u] << " -> " << name[v]
sl@0:       << "[label=\"" << get(weightmap, e) << "\"";
sl@0:     if (p[v] == u)
sl@0:       dot_file << ", color=\"black\"";
sl@0:     else
sl@0:       dot_file << ", color=\"grey\"";
sl@0:     dot_file << "]";
sl@0:   }
sl@0:   dot_file << "}";
sl@0:   
sl@0:    #ifdef __SYMBIAN32__
sl@0: 	std_log(LOG_FILENAME_LINE,"[End Test Case ]");
sl@0: 	testResultXml("dijkstra-example");
sl@0: 	close_log_file();
sl@0:     #endif
sl@0:   return EXIT_SUCCESS;
sl@0: }
sl@0: 
sl@0: 
sl@0: