8f15303620
* examples: Sort the examples in the Jamfile. This makes it easier to see which example files are even mentioned in the build. * examples: Build all examples. To at least test that they build with the current API. The newly-mentioned files here seem to be mostly (maybe all) the BGL book examples that were added in 2001:5215e9b4f2I would prefer to put these all in an examples/bgl_book subdirectory. * Examples build: Comment out examples that cannot be expected to build. For instance, because they depend on SBG or Stanford Graph. * Examples: Add missing <iostream> includes. * Examples: Comment out unused typedefs and variables. * Examples: king_ordering: Adapt to newer API. Specify the extra parameter for king_ordering(). The API was changed in 2005:4bc19a1621The test code was already correct: https://github.com/imvu/boost/blob/master/libs/graph/test/king_ordering.cpp * Examples: Some graphviz examples: Link to the library. read_graphviz() is not header only. * csr-example: Pass edge_are_sorted to constructor. To use the new (well, in 2009) API:809904f268* iteration_macros: Use BGL_FORALL_ADJ. Not BGL_FORALL_ADJACENT(), which doesn't exist, because this was changed in 2001:a0061ba07e* examples: kevin-bacon2: Fix the build. Include boost/serialization/string.hpp to fix this error: kevin-bacon2.cpp:68:9: required from here ../../../boost/serialization/access.hpp:116:9: error: ‘class std::__cxx11::basic_string<char>’ has no member named ‘serialize’ and link to the boost serialization library. * examples: loop_dfs: Add a missing typename keyword. * examples: accum-compile-times: Remove unused variables. * Examples: Remove unused typedefs. * examples: avoid warning about parentheses aronud &&. * example: read_graphviz: Actually use status. * Example: adj_list_ra_edgelist: Fix the build. The [] syntax must have worked once but doesn't anymore. This fixes the build but it is even more clearl now a stupid way to use the edge iterator. * Examples: Remove unused typedefs. * Examples: Remove an unused variable. * Example: iohb: A const correction. Otherwise newer compilers complain about converting string literals to char* when callig this function. * Exmaples: iohb: Avoid security warning with fprintf(). * Examples: Actually use a variable. * Examples: Comment out all Graphviz examples. These use the now-non-existant GraphizGraph and GraphvizDigraph types. Presumably these could be updated but it's not obvious how to do that: https://svn.boost.org/trac/boost/ticket/4762
72 lines
2.6 KiB
C++
72 lines
2.6 KiB
C++
//=======================================================================
|
|
// 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 <boost/graph/adjacency_list.hpp>
|
|
#include <boost/graph/kruskal_min_spanning_tree.hpp>
|
|
#include <iostream>
|
|
#include <fstream>
|
|
|
|
int
|
|
main()
|
|
{
|
|
using namespace boost;
|
|
typedef adjacency_list < vecS, vecS, undirectedS,
|
|
no_property, property < edge_weight_t, int > > Graph;
|
|
typedef graph_traits < Graph >::edge_descriptor Edge;
|
|
typedef std::pair<int, int> E;
|
|
|
|
const int num_nodes = 5;
|
|
E edge_array[] = { E(0, 2), E(1, 3), E(1, 4), E(2, 1), E(2, 3),
|
|
E(3, 4), E(4, 0), E(4, 1)
|
|
};
|
|
int weights[] = { 1, 1, 2, 7, 3, 1, 1, 1 };
|
|
std::size_t num_edges = sizeof(edge_array) / sizeof(E);
|
|
#if defined(BOOST_MSVC) && BOOST_MSVC <= 1300
|
|
Graph g(num_nodes);
|
|
property_map<Graph, edge_weight_t>::type weightmap = get(edge_weight, g);
|
|
for (std::size_t j = 0; j < num_edges; ++j) {
|
|
Edge e; bool inserted;
|
|
boost::tie(e, inserted) = add_edge(edge_array[j].first, edge_array[j].second, g);
|
|
weightmap[e] = weights[j];
|
|
}
|
|
#else
|
|
Graph g(edge_array, edge_array + num_edges, weights, num_nodes);
|
|
#endif
|
|
property_map < Graph, edge_weight_t >::type weight = get(edge_weight, g);
|
|
std::vector < Edge > spanning_tree;
|
|
|
|
kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
|
|
|
|
std::cout << "Print the edges in the MST:" << std::endl;
|
|
for (std::vector < Edge >::iterator ei = spanning_tree.begin();
|
|
ei != spanning_tree.end(); ++ei) {
|
|
std::cout << source(*ei, g) << " <--> " << target(*ei, g)
|
|
<< " with weight of " << weight[*ei]
|
|
<< std::endl;
|
|
}
|
|
|
|
std::ofstream fout("figs/kruskal-eg.dot");
|
|
fout << "graph A {\n"
|
|
<< " rankdir=LR\n"
|
|
<< " size=\"3,3\"\n"
|
|
<< " ratio=\"filled\"\n"
|
|
<< " edge[style=\"bold\"]\n" << " node[shape=\"circle\"]\n";
|
|
graph_traits<Graph>::edge_iterator eiter, eiter_end;
|
|
for (boost::tie(eiter, eiter_end) = edges(g); eiter != eiter_end; ++eiter) {
|
|
fout << source(*eiter, g) << " -- " << target(*eiter, g);
|
|
if (std::find(spanning_tree.begin(), spanning_tree.end(), *eiter)
|
|
!= spanning_tree.end())
|
|
fout << "[color=\"black\", label=\"" << get(edge_weight, g, *eiter)
|
|
<< "\"];\n";
|
|
else
|
|
fout << "[color=\"gray\", label=\"" << get(edge_weight, g, *eiter)
|
|
<< "\"];\n";
|
|
}
|
|
fout << "}\n";
|
|
return EXIT_SUCCESS;
|
|
}
|