graph_utility.hpp File Reference

#include <stdlib.h>
#include <iostream>
#include <algorithm>
#include <assert.h>
#include <boost/config.hpp>
#include <boost/tuple/tuple.hpp>
#include <slist>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/properties.hpp>
#include <boost/pending/container_traits.hpp>
#include <boost/graph/depth_first_search.hpp>
#include <boost/detail/algorithm.hpp>
#include <boost/graph/iteration_macros.hpp>

Include dependency graph for graph_utility.hpp:

This graph shows which files directly or indirectly include this file:

Classes
struct	boost::incident_from_predicate< Vertex, Graph >
struct	boost::incident_to_predicate< Vertex, Graph >
struct	boost::incident_on_predicate< Vertex, Graph >
struct	boost::connects_predicate< Vertex, Graph >
struct	boost::graph::add_removed_edge_property< EdgeProperty >
struct	boost::graph::add_removed_edge_capacity< Graph >

Namespaces
	boost
	Duration formatting facet for input.
	boost::graph

Functions
template<class UndirectedGraph >
std::pair< typename graph_traits< UndirectedGraph > ::vertex_descriptor, typename graph_traits< UndirectedGraph > ::vertex_descriptor >	boost::incident (typename graph_traits< UndirectedGraph >::edge_descriptor e, UndirectedGraph &g)
template<class Graph >
std::pair< typename graph_traits< Graph > ::out_edge_iterator, typename graph_traits< Graph > ::out_edge_iterator >	boost::incident_edges (typename graph_traits< Graph >::vertex_descriptor u, Graph &g)
template<class Graph >
graph_traits< Graph > ::vertex_descriptor	boost::opposite (typename graph_traits< Graph >::edge_descriptor e, typename graph_traits< Graph >::vertex_descriptor v, const Graph &g)
template<typename Vertex , typename Graph >
incident_from_predicate < Vertex, Graph >	boost::incident_from (Vertex u, const Graph &g)
template<typename Vertex , typename Graph >
incident_to_predicate< Vertex, Graph >	boost::incident_to (Vertex u, const Graph &g)
template<typename Vertex , typename Graph >
incident_on_predicate< Vertex, Graph >	boost::incident_on (Vertex u, const Graph &g)
template<typename Vertex , typename Graph >
connects_predicate< Vertex, Graph >	boost::connects (Vertex u, Vertex v, const Graph &g)
template<class IncidenceGraph , class Name >
void	boost::print_in_edges (const IncidenceGraph &G, Name name)
template<class IncidenceGraph , class Name >
void	boost::print_graph_dispatch (const IncidenceGraph &G, Name name, directed_tag)
template<class IncidenceGraph , class Name >
void	boost::print_graph_dispatch (const IncidenceGraph &G, Name name, undirected_tag)
template<class IncidenceGraph , class Name >
void	boost::print_graph (const IncidenceGraph &G, Name name)
template<class IncidenceGraph >
void	boost::print_graph (const IncidenceGraph &G)
template<class EdgeListGraph , class Name >
void	boost::print_edges (const EdgeListGraph &G, Name name)
template<class EdgeListGraph , class VertexName , class EdgeName >
void	boost::print_edges2 (const EdgeListGraph &G, VertexName vname, EdgeName ename)
template<class VertexListGraph , class Name >
void	boost::print_vertices (const VertexListGraph &G, Name name)
template<class Graph , class Vertex >
bool	boost::is_adj_dispatch (Graph &g, Vertex a, Vertex b, bidirectional_tag)
template<class Graph , class Vertex >
bool	boost::is_adj_dispatch (Graph &g, Vertex a, Vertex b, directed_tag)
template<class Graph , class Vertex >
bool	boost::is_adj_dispatch (Graph &g, Vertex a, Vertex b, undirected_tag)
template<class Graph , class Vertex >
bool	boost::is_adjacent (Graph &g, Vertex a, Vertex b)
template<class Graph , class Edge >
bool	boost::in_edge_set (Graph &g, Edge e)
template<class Graph , class Vertex >
bool	boost::in_vertex_set (Graph &g, Vertex v)
template<class Graph , class Vertex >
bool	boost::in_edge_set (Graph &g, Vertex u, Vertex v)
template<typename ParentMap >
bool	boost::is_descendant (typename property_traits< ParentMap >::value_type x, typename property_traits< ParentMap >::value_type y, ParentMap parent)
template<typename IncidenceGraph , typename VertexColorMap >
bool	boost::is_reachable (typename graph_traits< IncidenceGraph >::vertex_descriptor x, typename graph_traits< IncidenceGraph >::vertex_descriptor y, const IncidenceGraph &g, VertexColorMap color)
template<typename VertexListGraph , typename VertexColorMap >
bool	boost::is_connected (const VertexListGraph &g, VertexColorMap color)
template<typename Graph >
bool	boost::is_self_loop (typename graph_traits< Graph >::edge_descriptor e, const Graph &g)
template<class T1 , class T2 >
std::pair< T1, T2 >	boost::make_list (const T1 &t1, const T2 &t2)
template<class T1 , class T2 , class T3 >
std::pair< T1, std::pair< T2, T3 > >	boost::make_list (const T1 &t1, const T2 &t2, const T3 &t3)
template<class T1 , class T2 , class T3 , class T4 >
std::pair< T1, std::pair< T2, std::pair< T3, T4 > > >	boost::make_list (const T1 &t1, const T2 &t2, const T3 &t3, const T4 &t4)
template<class T1 , class T2 , class T3 , class T4 , class T5 >
std::pair< T1, std::pair< T2, std::pair< T3, std::pair< T4, T5 > > > >	boost::make_list (const T1 &t1, const T2 &t2, const T3 &t3, const T4 &t4, const T5 &t5)
template<typename Graph >
bool	boost::graph::has_no_vertices (const Graph &g)
template<typename Graph >
bool	boost::graph::has_no_edges (const Graph &g)
template<typename Graph >
bool	boost::graph::has_no_out_edges (const typename boost::graph_traits< Graph >::vertex_descriptor &v, const Graph &g)
template<class PropertyIn , class PropertyOut , class Graph >
void	boost::copy_vertex_property (PropertyIn p_in, PropertyOut p_out, Graph &g)
template<class PropertyIn , class PropertyOut , class Graph >
void	boost::copy_edge_property (PropertyIn p_in, PropertyOut p_out, Graph &g)
template<typename PropertyMapFirst , typename PropertyMapSecond , typename Graph >
bool	boost::are_property_maps_different (const PropertyMapFirst property_map1, const PropertyMapSecond property_map2, const Graph &graph)