mirror of
https://github.com/boostorg/graph.git
synced 2025-05-09 23:14:00 +00:00
74 lines
2.8 KiB
C++
74 lines
2.8 KiB
C++
//=======================================================================
|
|
// Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee,
|
|
//
|
|
// 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, Indiana University,
|
|
// Bloomington, IN 47405.
|
|
//
|
|
// Permission to modify the code and to distribute the code is
|
|
// granted, provided the text of this NOTICE is retained, a notice if
|
|
// 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/config.hpp>
|
|
#include <iostream>
|
|
#include <boost/graph/adjacency_list.hpp>
|
|
#include <boost/graph/prim_minimum_spanning_tree.hpp>
|
|
|
|
int
|
|
main()
|
|
{
|
|
using namespace boost;
|
|
typedef adjacency_list < vecS, vecS, undirectedS,
|
|
property<vertex_distance_t, int>, property < edge_weight_t, int > > Graph;
|
|
typedef std::pair < int, int >E;
|
|
const int num_nodes = 5;
|
|
E edges[] = { E(0, 2), E(1, 1), E(1, 3), E(1, 4), E(2, 1), E(2, 3),
|
|
E(3, 4), E(4, 0)
|
|
};
|
|
int weights[] = { 1, 2, 1, 2, 7, 3, 1, 1 };
|
|
#ifdef BOOST_MSVC
|
|
Graph g(num_nodes);
|
|
property_map<Graph, edge_weight_t>::type weightmap = get(edge_weight, g);
|
|
for (std::size_t j = 0; j < sizeof(edges) / sizeof(E); ++j) {
|
|
graph_traits<Graph>::edge_descriptor e; bool inserted;
|
|
tie(e, inserted) = add_edge(edges[j].first, edges[j].second, g);
|
|
weightmap[e] = weights[j];
|
|
}
|
|
#else
|
|
Graph g(edges, edges + sizeof(edges) / sizeof(E), weights, num_nodes);
|
|
property_map<Graph, edge_weight_t>::type weightmap = get(edge_weight, g);
|
|
#endif
|
|
std::vector < graph_traits < Graph >::vertex_descriptor >
|
|
p(num_vertices(g));
|
|
|
|
#ifdef BOOST_MSVC
|
|
property_map<Graph, vertex_distance_t>::type distance = get(vertex_distance, g);
|
|
property_map<Graph, vertex_index_t>::type indexmap = get(vertex_index, g);
|
|
prim_minimum_spanning_tree
|
|
(g, *vertices(g).first, &p[0], distance, weightmap, indexmap,
|
|
default_dijkstra_visitor());
|
|
#else
|
|
prim_minimum_spanning_tree(g, &p[0]);
|
|
#endif
|
|
|
|
for (std::size_t i = 0; i != p.size(); ++i)
|
|
if (p[i] != i)
|
|
std::cout << "parent[" << i << "] = " << p[i] << std::endl;
|
|
else
|
|
std::cout << "parent[" << i << "] = no parent" << std::endl;
|
|
|
|
return EXIT_SUCCESS;
|
|
}
|