ug4
|
#include <bidirectional_boost.h>
Public Types | |
typedef SM_adjacency_iterator< value_type > | adjacency_iterator |
typedef int | degree_size_type |
typedef bidirectional_tag | directed_category |
typedef SM_edge< value_type > | edge_descriptor |
typedef disallow_parallel_edge_tag | edge_parallel_category |
typedef SM_out_edge_iterator< value_type, false > | in_edge_iterator |
typedef SM_out_edge_iterator< value_type, true > | out_edge_iterator |
typedef BS_traversal_tag | traversal_category |
typedef T::value_type | value_type |
typedef int | vertex_descriptor |
typedef counting_iterator< size_t > | vertex_iterator |
typedef int | vertices_size_type |
typedef SM_adjacency_iterator<value_type> boost::graph_traits< ug::BidirectionalMatrix< T > >::adjacency_iterator |
typedef int boost::graph_traits< ug::BidirectionalMatrix< T > >::degree_size_type |
typedef bidirectional_tag boost::graph_traits< ug::BidirectionalMatrix< T > >::directed_category |
typedef SM_edge<value_type> boost::graph_traits< ug::BidirectionalMatrix< T > >::edge_descriptor |
typedef disallow_parallel_edge_tag boost::graph_traits< ug::BidirectionalMatrix< T > >::edge_parallel_category |
typedef SM_out_edge_iterator<value_type, false> boost::graph_traits< ug::BidirectionalMatrix< T > >::in_edge_iterator |
typedef SM_out_edge_iterator<value_type, true> boost::graph_traits< ug::BidirectionalMatrix< T > >::out_edge_iterator |
typedef BS_traversal_tag boost::graph_traits< ug::BidirectionalMatrix< T > >::traversal_category |
typedef T::value_type boost::graph_traits< ug::BidirectionalMatrix< T > >::value_type |
typedef int boost::graph_traits< ug::BidirectionalMatrix< T > >::vertex_descriptor |
typedef counting_iterator<size_t> boost::graph_traits< ug::BidirectionalMatrix< T > >::vertex_iterator |
typedef int boost::graph_traits< ug::BidirectionalMatrix< T > >::vertices_size_type |