From 483eb2f56657e8e7f419ab1a4fab8dce9ade8609 Mon Sep 17 00:00:00 2001 From: Daniel Baumann Date: Sat, 27 Apr 2024 20:24:20 +0200 Subject: Adding upstream version 14.2.21. Signed-off-by: Daniel Baumann --- src/boost/libs/graph/example/leda-graph-eg.cpp | 28 ++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 src/boost/libs/graph/example/leda-graph-eg.cpp (limited to 'src/boost/libs/graph/example/leda-graph-eg.cpp') diff --git a/src/boost/libs/graph/example/leda-graph-eg.cpp b/src/boost/libs/graph/example/leda-graph-eg.cpp new file mode 100644 index 00000000..4fddab84 --- /dev/null +++ b/src/boost/libs/graph/example/leda-graph-eg.cpp @@ -0,0 +1,28 @@ +//======================================================================= +// Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee, +// +// Distributed under the Boost Software License, Version 1.0. (See +// accompanying file LICENSE_1_0.txt or copy at +// http://www.boost.org/LICENSE_1_0.txt) +//======================================================================= +#include +#include +#undef string // LEDA macro! +int +main() +{ + using namespace boost; + typedef leda::GRAPH < std::string, int >graph_t; + graph_t g; + g.new_node("Philoctetes"); + g.new_node("Heracles"); + g.new_node("Alcmena"); + g.new_node("Eurystheus"); + g.new_node("Amphitryon"); + typedef property_map < graph_t, vertex_all_t >::type NodeMap; + NodeMap node_name_map = get(vertex_all, g); + graph_traits < graph_t >::vertex_iterator vi, vi_end; + for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi) + std::cout << node_name_map[*vi] << std::endl; + return EXIT_SUCCESS; +} -- cgit v1.2.3