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
74 lines
2.0 KiB
C++
74 lines
2.0 KiB
C++
//=======================================================================
|
|
// Copyright 1997, 1998, 1999, 2000 University of Notre Dame.
|
|
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
|
|
//
|
|
// 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)
|
|
//=======================================================================
|
|
//
|
|
// Sample output
|
|
// DFS parenthesis:
|
|
// (0(2(3(4(11)4)3)2)0)
|
|
|
|
#include <boost/config.hpp>
|
|
#include <assert.h>
|
|
#include <iostream>
|
|
|
|
#include <vector>
|
|
#include <algorithm>
|
|
#include <utility>
|
|
|
|
#include "boost/graph/visitors.hpp"
|
|
#include "boost/graph/adjacency_list.hpp"
|
|
#include "boost/graph/breadth_first_search.hpp"
|
|
#include "boost/graph/depth_first_search.hpp"
|
|
|
|
using namespace boost;
|
|
using namespace std;
|
|
|
|
struct open_paren : public base_visitor<open_paren> {
|
|
typedef on_discover_vertex event_filter;
|
|
template <class Vertex, class Graph>
|
|
void operator()(Vertex v, Graph&) {
|
|
std::cout << "(" << v;
|
|
}
|
|
};
|
|
struct close_paren : public base_visitor<close_paren> {
|
|
typedef on_finish_vertex event_filter;
|
|
template <class Vertex, class Graph>
|
|
void operator()(Vertex v, Graph&) {
|
|
std::cout << v << ")";
|
|
}
|
|
};
|
|
|
|
|
|
int
|
|
main(int, char*[])
|
|
{
|
|
|
|
using namespace boost;
|
|
|
|
typedef adjacency_list<> Graph;
|
|
typedef std::pair<int,int> E;
|
|
E edge_array[] = { E(0, 2),
|
|
E(1, 1), E(1, 3),
|
|
E(2, 1), E(2, 3),
|
|
E(3, 1), E(3, 4),
|
|
E(4, 0), E(4, 1) };
|
|
#if defined(BOOST_MSVC) && BOOST_MSVC <= 1300
|
|
Graph G(5);
|
|
for (std::size_t j = 0; j < sizeof(edge_array) / sizeof(E); ++j)
|
|
add_edge(edge_array[j].first, edge_array[j].second, G);
|
|
#else
|
|
Graph G(edge_array, edge_array + sizeof(edge_array)/sizeof(E), 5);
|
|
#endif
|
|
|
|
std::cout << "DFS parenthesis:" << std::endl;
|
|
depth_first_search(G, visitor(make_dfs_visitor(std::make_pair(open_paren(),
|
|
close_paren()))));
|
|
std::cout << std::endl;
|
|
return 0;
|
|
}
|
|
|