mirror of
https://github.com/boostorg/graph.git
synced 2025-05-09 23:14:00 +00:00
58 lines
2.1 KiB
C++
58 lines
2.1 KiB
C++
//=======================================================================
|
|
// Copyright 1997, 1998, 1999, 2000 University of Notre Dame.
|
|
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
|
|
//
|
|
// This file is part of the Boost Graph Library
|
|
//
|
|
// You should have received a copy of the License Agreement for the
|
|
// Boost Graph Library along with the software; see the file LICENSE.
|
|
// If not, contact Office of Research, University of Notre Dame, Notre
|
|
// Dame, IN 46556.
|
|
//
|
|
// Permission to modify the code and to distribute modified code is
|
|
// granted, provided the text of this NOTICE is retained, a notice that
|
|
// the code was modified is included with the above COPYRIGHT NOTICE and
|
|
// with the COPYRIGHT NOTICE in the LICENSE file, and that the LICENSE
|
|
// file is distributed with the modified code.
|
|
//
|
|
// LICENSOR MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED.
|
|
// By way of example, but not limitation, Licensor MAKES NO
|
|
// REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY
|
|
// PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE COMPONENTS
|
|
// OR DOCUMENTATION WILL NOT INFRINGE ANY PATENTS, COPYRIGHTS, TRADEMARKS
|
|
// OR OTHER RIGHTS.
|
|
//=======================================================================
|
|
|
|
#include <boost/graph/dag_shortest_paths.hpp>
|
|
#include <boost/graph/adjacency_list.hpp>
|
|
|
|
int main()
|
|
{
|
|
using namespace boost;
|
|
typedef adjacency_list<vecS, vecS, directedS,
|
|
property<vertex_distance_t, int>, property<edge_weight_t, int> > graph_t;
|
|
graph_t g(6);
|
|
enum verts { r, s, t, u, v, x };
|
|
add_edge(r, s, 5, g);
|
|
add_edge(r, t, 3, g);
|
|
add_edge(s, t, 2, g);
|
|
add_edge(s, u, 6, g);
|
|
add_edge(t, u, 7, g);
|
|
add_edge(t, v, 4, g);
|
|
add_edge(t, x, 2, g);
|
|
add_edge(u, v, -1, g);
|
|
add_edge(u, x, 1, g);
|
|
add_edge(v, x, -2, g);
|
|
|
|
property_map<graph_t, vertex_distance_t>::type
|
|
d_map = get(vertex_distance, g);
|
|
|
|
dag_shortest_paths(g, s, distance_map(d_map));
|
|
|
|
graph_traits<graph_t>::vertex_iterator vi , vi_end;
|
|
for (tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi)
|
|
std::cout << *vi << ": " << d_map[*vi] << std::endl;
|
|
|
|
return 0;
|
|
}
|