template<class V, class E, class VKey, class EKey, class Alloc>
struct boost::graph_traits< Sawyer::Container::Graph< V, E, VKey, EKey, Alloc > >
Definition at line 514 of file GraphBoost.h.
|
|
typedef bidirectional_graph_tag | traversal_category |
| |
|
typedef size_t | vertex_descriptor |
| |
|
typedef size_t | edge_descriptor |
| |
|
typedef directed_tag | directed_category |
| |
|
typedef allow_parallel_edge_tag | edge_parallel_category |
| |
|
typedef Sawyer::Boost::VertexOuterIterator< V, E, VKey, EKey, Alloc > | vertex_iterator |
| |
|
typedef size_t | vertices_size_type |
| |
|
typedef Sawyer::Boost::EdgeOuterIterator< V, E, VKey, EKey, Alloc > | edge_iterator |
| |
|
typedef size_t | edges_size_type |
| |
|
typedef Sawyer::Boost::EdgeOuterIterator< V, E, VKey, EKey, Alloc > | out_edge_iterator |
| |
|
typedef size_t | degree_size_type |
| |
|
typedef Sawyer::Boost::EdgeOuterIterator< V, E, VKey, EKey, Alloc > | in_edge_iterator |
| |
|
typedef Sawyer::Container::Graph< V, E, VKey, EKey, Alloc >::VertexValue | vertex_property_type |
| |
|
typedef Sawyer::Container::Graph< V, E, VKey, EKey, Alloc >::EdgeValue | edge_property_type |
| |
