ug4
bidirectional_boost.h File Reference
#include "bidirectional.h"

Go to the source code of this file.

Classes

struct  boost::BS_traversal_tag
 
struct  boost::graph_traits< ug::BidirectionalMatrix< T > >
 
struct  boost::property_map< ug::BidirectionalMatrix< ug::SparseMatrix< T > >, vertex_index_t >
 

Namespaces

 boost
 

Functions

template<class T >
std::pair< typename graph_traits< T >::adjacency_iterator, typename graph_traits< T >::adjacency_iterator > boost::adjacent_vertices (size_t v, ug::BidirectionalMatrix< T > const &M)
 
template<class T >
std::pair< typename graph_traits< T >::adjacency_iterator, typename graph_traits< T >::adjacency_iterator > boost::coadjacent_vertices (size_t v, ug::BidirectionalMatrix< T > const &M)
 
template<class T >
int boost::degree (int v, ug::BidirectionalMatrix< T > const &M)
 
template<class T >
SM_edge_weight_map< typename T::value_type, ug::BidirectionalMatrix< T > > boost::get (edge_weight_t, ug::BidirectionalMatrix< T > const &g)
 
template<class T >
property_map< ug::BidirectionalMatrix< ug::SparseMatrix< T > >, vertex_index_t >::const_type boost::get (vertex_index_t, ug::BidirectionalMatrix< T > const &m)
 
template<class T >
int boost::in_degree (int v, ug::BidirectionalMatrix< T > const &M)
 
template<class T >
std::pair< SM_out_edge_iterator< typename T::value_type, false >, SM_out_edge_iterator< typename T::value_type, false > > boost::in_edges (size_t v, ug::BidirectionalMatrix< T > const &g)
 
template<class T >
int boost::num_vertices (ug::BidirectionalMatrix< T > const &M)
 
template<class T >
int boost::out_degree (int v, ug::BidirectionalMatrix< T > const &M)
 
template<class T >
std::pair< SM_out_edge_iterator< typename T::value_type >, SM_out_edge_iterator< typename T::value_type > > boost::out_edges (size_t v, ug::BidirectionalMatrix< T > const &g)
 
template<class T >
size_t boost::source (SM_edge< typename T::value_type > const &e, ug::BidirectionalMatrix< T > const &)
 
template<class T >
size_t boost::target (SM_edge< typename T::value_type > const &e, ug::BidirectionalMatrix< T > const &m)
 
template<class T >
std::pair< counting_iterator< size_t >, counting_iterator< size_t > > boost::vertices (ug::BidirectionalMatrix< T > const &M)