16#include <boost/graph/graph_traits.hpp>
17#include <boost/graph/adjacency_list.hpp>
18#include <boost/graph/dijkstra_shortest_paths.hpp>
19#include <boost/graph/labeled_graph.hpp>
49 typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS,
52 typedef boost::graph_traits<t_graph>::edge_descriptor
t_edge;
53 typedef boost::graph_traits<t_graph>::vertex_descriptor
t_vertex;
66 template<
typename ALGO>
inline int load_and_run ( ALGO
const & );
109 typedef std::pair<bool, boost::graph_traits<gtool::t_graph>::vertex_iterator>
t_lookup_ret;
181 return algo (
static_cast<gtool const &
> ( *
this ) );