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
61 lines
1.9 KiB
C++
61 lines
1.9 KiB
C++
// Copyright 2005 The Trustees of Indiana University.
|
|
|
|
// Use, modification and distribution is subject to 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)
|
|
|
|
// Authors: Douglas Gregor
|
|
// Andrew Lumsdaine
|
|
#include <boost/graph/compressed_sparse_row_graph.hpp>
|
|
#include <string>
|
|
#include <boost/graph/iteration_macros.hpp>
|
|
#include <iostream>
|
|
#include <fstream>
|
|
#include <boost/graph/graphviz.hpp>
|
|
|
|
using namespace boost;
|
|
|
|
class WebPage
|
|
{
|
|
public:
|
|
std::string url;
|
|
};
|
|
|
|
int main()
|
|
{
|
|
typedef std::pair<int, int> E;
|
|
const char* urls[6] = {
|
|
"http://www.boost.org/libs/graph/doc/index.html",
|
|
"http://www.boost.org/libs/graph/doc/table_of_contents.html",
|
|
"http://www.boost.org/libs/graph/doc/adjacency_list.html",
|
|
"http://www.boost.org/libs/graph/doc/history.html",
|
|
"http://www.boost.org/libs/graph/doc/bundles.html",
|
|
"http://www.boost.org/libs/graph/doc/using_adjacency_list.html",
|
|
};
|
|
|
|
E the_edges[] = { E(0, 1), E(0, 2), E(0, 3), E(1, 0), E(1, 3), E(1, 5),
|
|
E(2, 0), E(2, 5), E(3, 1), E(3, 4), E(4, 1), E(5, 0),
|
|
E(5, 2) };
|
|
|
|
typedef compressed_sparse_row_graph<directedS, WebPage> WebGraph;
|
|
WebGraph g(boost::edges_are_sorted, &the_edges[0], &the_edges[0] + sizeof(the_edges)/sizeof(E), 6);
|
|
|
|
// Set the URLs of each vertex
|
|
int index = 0;
|
|
BGL_FORALL_VERTICES(v, g, WebGraph)
|
|
g[v].url = urls[index++];
|
|
|
|
// Output each of the links
|
|
std::cout << "The web graph:" << std::endl;
|
|
BGL_FORALL_EDGES(e, g, WebGraph)
|
|
std::cout << " " << g[source(e, g)].url << " -> " << g[target(e, g)].url
|
|
<< std::endl;
|
|
|
|
// Output the graph in DOT format
|
|
dynamic_properties dp;
|
|
dp.property("label", get(&WebPage::url, g));
|
|
std::ofstream out("web-graph.dot");
|
|
write_graphviz(out, g, dp, std::string(), get(vertex_index, g));
|
|
return 0;
|
|
}
|