Graph wrapper which maintains an edge index. More...
#include <edge_indexed_graph.h>
Public Types | |
typedef boost::graph_traits < Graph >::vertex_descriptor | vertex_descriptor |
typedef boost::graph_traits < Graph >::edge_descriptor | edge_descriptor |
typedef boost::graph_traits < Graph >::adjacency_iterator | adjacency_iterator |
typedef boost::graph_traits < Graph >::out_edge_iterator | out_edge_iterator |
typedef boost::graph_traits < Graph >::in_edge_iterator | in_edge_iterator |
typedef boost::graph_traits < Graph >::vertex_iterator | vertex_iterator |
typedef boost::graph_traits < Graph >::directed_category | directed_category |
typedef boost::graph_traits < Graph > ::edge_parallel_category | edge_parallel_category |
typedef boost::graph_traits < Graph >::traversal_category | traversal_category |
typedef boost::graph_traits < Graph >::vertices_size_type | vertices_size_type |
typedef boost::graph_traits < Graph >::edges_size_type | edges_size_type |
typedef boost::graph_traits < Graph >::degree_size_type | degree_size_type |
typedef std::vector < edge_descriptor > ::const_iterator | edge_iterator |
typedef vector_ref_property_map < edge_descriptor > | EdgeVectorMap |
Public Member Functions | |
edge_indexed_graph (Graph &g, EdgeIndexMap edge_index_map) | |
Static Public Member Functions | |
static vertex_descriptor | null_vertex () |
Public Attributes | |
Graph & | m_g |
EdgeIndexMap | edge_index_map |
std::vector< edge_descriptor > | edge_vector |
EdgeVectorMap | edge_vector_map |
Graph wrapper which maintains an edge index.
The EdgeIndexedGraph class wraps an existing graph object, while additionally maintaining incrementing edge indices in supplied property maps. The behavior is undefined if edges are not removed in the inverse order that they are added.