-Here we show the construction of the graph. For simplicity we have +Here we show the construction of the graph. First, these are the required +header files: + +
+
+#include <iostream> // std::cout +#include <utility> // std::pair +#include <boost/graph/graph_traits.hpp> +#include <boost/graph/adjacency_list.hpp> +#include <boost/graph/topological_sort.hpp> ++ +
+For simplicity we have constructed the graph "by-hand". A compilation system such as make would instead parse a Makefile to get the list of files and to set-up the dependencies. We use the Index: boost_1_33_1/libs/graph/doc/write-graphviz.html =================================================================== --- boost_1_33_1.orig/libs/graph/doc/write-graphviz.html +++ boost_1_33_1/libs/graph/doc/write-graphviz.html @@ -234,6 +234,8 @@ This example demonstrates using BGL-grap a BGL graph into a graphviz format file.
+#include <boost/graph/graphviz.hpp>
+
enum files_e { dax_h, yow_h, boz_h, zow_h, foo_cpp,
foo_o, bar_cpp, bar_o, libfoobar_a,
zig_cpp, zig_o, zag_cpp, zag_o,