mirror of
https://github.com/boostorg/graph.git
synced 2025-05-09 23:14:00 +00:00
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
92 lines
2.4 KiB
C++
92 lines
2.4 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/config.hpp>
|
|
#include <iostream>
|
|
#include <fstream>
|
|
#include <string>
|
|
#include <boost/tuple/tuple.hpp>
|
|
#include <boost/graph/adjacency_list.hpp>
|
|
#include <boost/graph/visitors.hpp>
|
|
#include <boost/graph/breadth_first_search.hpp>
|
|
#include <map>
|
|
#include <boost/graph/adj_list_serialize.hpp>
|
|
#include <boost/archive/text_iarchive.hpp>
|
|
#include <boost/serialization/string.hpp>
|
|
|
|
struct vertex_properties {
|
|
std::string name;
|
|
|
|
template<class Archive>
|
|
void serialize(Archive & ar, const unsigned int version) {
|
|
ar & name;
|
|
}
|
|
};
|
|
|
|
struct edge_properties {
|
|
std::string name;
|
|
|
|
template<class Archive>
|
|
void serialize(Archive & ar, const unsigned int version) {
|
|
ar & name;
|
|
}
|
|
};
|
|
|
|
using namespace boost;
|
|
|
|
typedef adjacency_list<vecS, vecS, undirectedS,
|
|
vertex_properties, edge_properties> Graph;
|
|
typedef graph_traits<Graph>::vertex_descriptor Vertex;
|
|
typedef graph_traits<Graph>::edge_descriptor Edge;
|
|
|
|
class bacon_number_recorder : public default_bfs_visitor
|
|
{
|
|
public:
|
|
bacon_number_recorder(int* dist) : d(dist) { }
|
|
|
|
void tree_edge(Edge e, const Graph& g) const {
|
|
Vertex u = source(e, g), v = target(e, g);
|
|
d[v] = d[u] + 1;
|
|
}
|
|
private:
|
|
int* d;
|
|
};
|
|
|
|
int main()
|
|
{
|
|
std::ifstream ifs("./kevin-bacon2.dat");
|
|
if (!ifs) {
|
|
std::cerr << "No ./kevin-bacon2.dat file" << std::endl;
|
|
return EXIT_FAILURE;
|
|
}
|
|
archive::text_iarchive ia(ifs);
|
|
Graph g;
|
|
ia >> g;
|
|
|
|
std::vector<int> bacon_number(num_vertices(g));
|
|
|
|
// Get the vertex for Kevin Bacon
|
|
Vertex src;
|
|
graph_traits<Graph>::vertex_iterator i, end;
|
|
for (boost::tie(i, end) = vertices(g); i != end; ++i)
|
|
if (g[*i].name == "Kevin Bacon")
|
|
src = *i;
|
|
|
|
// Set Kevin's number to zero
|
|
bacon_number[src] = 0;
|
|
|
|
// Perform a breadth first search to compute everyone' Bacon number.
|
|
breadth_first_search(g, src,
|
|
visitor(bacon_number_recorder(&bacon_number[0])));
|
|
|
|
for (boost::tie(i, end) = vertices(g); i != end; ++i)
|
|
std::cout << g[*i].name << " has a Bacon number of "
|
|
<< bacon_number[*i] << std::endl;
|
|
|
|
return 0;
|
|
}
|