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
107 lines
2.9 KiB
C++
107 lines
2.9 KiB
C++
// Copyright 2008 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)
|
|
|
|
// An example of using read_graphviz to load a GraphViz Dot textual
|
|
// graph into a BGL adjacency_list graph that has custom properties.
|
|
|
|
// Author: Ronald Garcia
|
|
|
|
|
|
|
|
#include <boost/graph/graphviz.hpp>
|
|
#include <boost/graph/adjacency_list.hpp>
|
|
#include <boost/foreach.hpp>
|
|
#include <string>
|
|
#include <sstream>
|
|
|
|
using namespace boost;
|
|
using namespace std;
|
|
|
|
|
|
//
|
|
// Create a custom graph properties
|
|
// (see the documentation for adjacency list)
|
|
struct graph_identifier_t { typedef graph_property_tag kind; };
|
|
struct vertex_label_t { typedef vertex_property_tag kind; };
|
|
|
|
int main() {
|
|
|
|
// Vertex properties
|
|
typedef property < vertex_name_t, string,
|
|
property < vertex_label_t, string,
|
|
property < vertex_root_t, int > > > vertex_p;
|
|
// Edge properties
|
|
typedef property < edge_name_t, string > edge_p;
|
|
// Graph properties
|
|
typedef property < graph_name_t, string,
|
|
property < graph_identifier_t, string > > graph_p;
|
|
// adjacency_list-based type
|
|
typedef adjacency_list < vecS, vecS, directedS,
|
|
vertex_p, edge_p, graph_p > graph_t;
|
|
|
|
// Construct an empty graph and prepare the dynamic_property_maps.
|
|
graph_t graph(0);
|
|
dynamic_properties dp;
|
|
|
|
property_map<graph_t, vertex_name_t>::type vname =
|
|
get(vertex_name, graph);
|
|
dp.property("node_id",vname);
|
|
|
|
property_map<graph_t, vertex_label_t>::type vlabel =
|
|
get(vertex_label_t(), graph);
|
|
dp.property("label",vlabel);
|
|
|
|
property_map<graph_t, vertex_root_t>::type root =
|
|
get(vertex_root, graph);
|
|
dp.property("root",root);
|
|
|
|
property_map<graph_t, edge_name_t>::type elabel =
|
|
get(edge_name, graph);
|
|
dp.property("label",elabel);
|
|
|
|
// Use ref_property_map to turn a graph property into a property map
|
|
ref_property_map<graph_t*,string>
|
|
gname(get_property(graph,graph_name));
|
|
dp.property("name",gname);
|
|
|
|
// Use ref_property_map to turn a graph property into a property map
|
|
ref_property_map<graph_t*,string>
|
|
gid(get_property(graph,graph_identifier_t()));
|
|
dp.property("identifier",gid);
|
|
// Sample graph as an istream;
|
|
|
|
const char* dot =
|
|
"digraph \
|
|
{ \
|
|
graph [name=\"GRAPH\", identifier=\"CX2A1Z\"] \
|
|
\
|
|
a [label=\"NODE_A\", root=\"1\"] \
|
|
b [label=\"NODE_B\", root=\"0\"] \
|
|
\
|
|
a -> b [label=\"EDGE_1\"] \
|
|
b -> c [label=\"EDGE_2\"] \
|
|
}";
|
|
|
|
|
|
istringstream gvgraph(dot);
|
|
|
|
bool status = read_graphviz(gvgraph,graph,dp,"node_id");
|
|
if (!status) {
|
|
cerr << "read_graphviz() failed." << endl;
|
|
return -1;
|
|
}
|
|
|
|
cout << "graph " << get("name",dp,&graph) <<
|
|
" (" << get("identifier",dp,&graph) << ")\n\n";
|
|
|
|
BOOST_FOREACH( graph_t::vertex_descriptor v, vertices(graph) ) {
|
|
cout << "vertex " << get("node_id",dp,v) <<
|
|
" (" << get("label",dp,v) << ")\n";
|
|
}
|
|
|
|
return 0;
|
|
}
|