Loading [MathJax]/extensions/tex2jax.js
ug4
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
boost Namespace Reference

Namespaces

namespace  mpl
 
namespace  serialization
 

Classes

class  bglp_matrix_index_map
 
struct  BS_traversal_tag
 
class  bucket_sorter
 
class  degree_property_map< ug::UndirectedMatrix< T > >
 
struct  graph_traits< ug::BGLParallelMatrix< ug::ParallelMatrix< T > > >
 
struct  graph_traits< ug::BidirectionalMatrix< T > >
 
struct  graph_traits< ug::ParallelMatrix< ug::SparseMatrix< T > > >
 
struct  graph_traits< ug::SparseMatrix< T > >
 
struct  graph_traits< ug::UndirectedMatrix< T > >
 
struct  pointee< ConstSmartPtr< T > >
 
struct  pointee< SmartPtr< T > >
 
struct  property_map< ug::BGLParallelMatrix< T >, vertex_index_t >
 
struct  property_map< ug::BidirectionalMatrix< ug::SparseMatrix< T > >, vertex_index_t >
 
struct  property_map< ug::ParallelMatrix< T >, vertex_index_t >
 
struct  property_map< ug::SparseMatrix< T >, Tag >
 
struct  property_map< ug::SparseMatrix< T >, vertex_index_t >
 
struct  property_map< ug::UndirectedMatrix< T >, vertex_index_t >
 
class  SM_adjacency_iterator
 
class  SM_edge
 
class  SM_edge_weight_map
 
class  SM_out_edge_iterator
 
struct  SM_traversal_tag
 
class  sparse_matrix_index_map
 
class  UM_out_edge_iterator
 

Functions

template<class T >
std::pair< typename graph_traits< T >::adjacency_iterator, typename graph_traits< T >::adjacency_iterator > adjacent_vertices (size_t v, ug::BidirectionalMatrix< T > const &M)
 
template<class T >
std::pair< typename graph_traits< ug::SparseMatrix< T > >::adjacency_iterator, typename graph_traits< ug::SparseMatrix< T > >::adjacency_iterator > adjacent_vertices (size_t v, ug::SparseMatrix< T > const &M)
 
template<class T >
std::pair< typename ug::UndirectedMatrix< T >::adjacency_iterator, typename ug::UndirectedMatrix< T >::adjacency_iterator > adjacent_vertices (size_t v, ug::UndirectedMatrix< T > const &M)
 
template<class T >
std::pair< typename ug::BGLParallelMatrix< T >::adjacency_iterator, typename ug::BGLParallelMatrix< T >::adjacency_iterator > adjacent_vertices (typename ug::BGLParallelMatrix< T >::vertex_descriptor v, ug::BGLParallelMatrix< T > const &M)
 
template<class T >
std::pair< typename graph_traits< T >::adjacency_iterator, typename graph_traits< T >::adjacency_iterator > coadjacent_vertices (size_t v, ug::BidirectionalMatrix< T > const &M)
 
template<class T >
int degree (int v, ug::BidirectionalMatrix< T > const &M)
 
template<class T >
int degree (int v, ug::UndirectedMatrix< T > const &M)
 
template<class T >
SM_edge_weight_map< T > get (edge_weight_t, ug::BGLParallelMatrix< T > const &g)
 
template<class T >
SM_edge_weight_map< typename T::value_type, ug::BidirectionalMatrix< T > > get (edge_weight_t, ug::BidirectionalMatrix< T > const &g)
 
template<class T >
SM_edge_weight_map< T > get (edge_weight_t, ug::SparseMatrix< T > const &g)
 
template<class T >
property_map< ug::BGLParallelMatrix< T >, vertex_index_t >::const_type get (vertex_index_t, ug::BGLParallelMatrix< T > const &m)
 
template<class T >
property_map< ug::BidirectionalMatrix< ug::SparseMatrix< T > >, vertex_index_t >::const_type get (vertex_index_t, ug::BidirectionalMatrix< T > const &m)
 
template<class T >
property_map< ug::SparseMatrix< T >, vertex_index_t >::const_type get (vertex_index_t, ug::SparseMatrix< T > const &m)
 
template<class T >
property_map< ug::UndirectedMatrix< T >, vertex_index_t >::const_type get (vertex_index_t, ug::UndirectedMatrix< T > const &m)
 
template<class T >
int in_degree (int v, ug::BidirectionalMatrix< T > const &M)
 
template<class T >
int in_degree (int v, ug::UndirectedMatrix< 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 > > in_edges (size_t v, ug::BidirectionalMatrix< T > const &g)
 
template<class T >
degree_property_map< ug::UndirectedMatrix< T > > make_degree_map (const ug::UndirectedMatrix< T > &g)
 
template<class T >
size_t num_vertices (ug::BGLParallelMatrix< T > const &)
 
template<class T >
int num_vertices (ug::BidirectionalMatrix< T > const &M)
 
template<class T >
int num_vertices (ug::SparseMatrix< T > const &M)
 
template<class T >
int num_vertices (ug::UndirectedMatrix< T > const &M)
 
template<class T >
int out_degree (int v, ug::BidirectionalMatrix< T > const &M)
 
template<class T >
int out_degree (int v, ug::SparseMatrix< T > const &M)
 
template<class T >
int out_degree (int v, ug::UndirectedMatrix< T > const &M)
 
template<class T >
int out_degree (typename ug::BGLParallelMatrix< T >::vertex_descriptor v, ug::BGLParallelMatrix< T > const &M)
 
template<class T >
std::pair< SM_out_edge_iterator< T >, SM_out_edge_iterator< T > > out_edges (int v, ug::SparseMatrix< T > const &g)
 
template<class T >
std::pair< UM_out_edge_iterator< T >, UM_out_edge_iterator< T > > out_edges (int v, ug::UndirectedMatrix< T > const &M)
 
template<class T >
std::pair< SM_out_edge_iterator< typename T::value_type >, SM_out_edge_iterator< typename T::value_type > > out_edges (size_t v, ug::BidirectionalMatrix< T > const &g)
 
template<class T >
std::pair< typename ug::BGLParallelMatrix< T >::out_edge_iterator, typename ug::BGLParallelMatrix< T >::out_edge_iterator > out_edges (typename ug::BGLParallelMatrix< T >::vertex_descriptor v, ug::BGLParallelMatrix< T > const &M)
 
template<class T , class M >
int source (SM_edge< T > const &e, M const &)
 
template<class T >
size_t source (SM_edge< typename T::value_type > const &e, ug::BidirectionalMatrix< T > const &)
 
template<class T >
int source (typename T::edge const &e, T const &)
 
template<class T >
ug::BGLParallelMatrix< T >::vertex_descriptor source (typename ug::BGLParallelMatrix< T >::edge const &e, ug::BGLParallelMatrix< T > const &)
 
template<class T , class M >
int target (SM_edge< T > const &e, M const &)
 
template<class T >
size_t target (SM_edge< typename T::value_type > const &e, ug::BidirectionalMatrix< T > const &m)
 
template<class T >
int target (typename T::edge const &e, T const &)
 
template<class T >
ug::BGLParallelMatrix< T >::vertex_descriptor target (typename ug::BGLParallelMatrix< T >::edge const &e, ug::BGLParallelMatrix< T > const &)
 
template<class T >
std::pair< typename ug::BGLParallelMatrix< T >::vertex_iterator, typename ug::BGLParallelMatrix< T >::vertex_iterator > vertices (ug::BGLParallelMatrix< T > const &M)
 
template<class T >
std::pair< counting_iterator< size_t >, counting_iterator< size_t > > vertices (ug::BidirectionalMatrix< T > const &M)
 
template<class T >
std::pair< counting_iterator< size_t >, counting_iterator< size_t > > vertices (ug::ParallelMatrix< ug::SparseMatrix< T > > const &M)
 
template<class T >
std::pair< counting_iterator< size_t >, counting_iterator< size_t > > vertices (ug::SparseMatrix< T > const &M)
 
template<class T >
std::pair< counting_iterator< size_t >, counting_iterator< size_t > > vertices (ug::UndirectedMatrix< T > const &M)
 

Function Documentation

◆ adjacent_vertices() [1/4]

◆ adjacent_vertices() [2/4]

template<class T >
std::pair< typename graph_traits< ug::SparseMatrix< T > >::adjacency_iterator, typename graph_traits< ug::SparseMatrix< T > >::adjacency_iterator > boost::adjacent_vertices ( size_t  v,
ug::SparseMatrix< T > const &  M 
)
inline

◆ adjacent_vertices() [3/4]

template<class T >
std::pair< typename ug::UndirectedMatrix< T >::adjacency_iterator, typename ug::UndirectedMatrix< T >::adjacency_iterator > boost::adjacent_vertices ( size_t  v,
ug::UndirectedMatrix< T > const &  M 
)

◆ adjacent_vertices() [4/4]

template<class T >
std::pair< typename ug::BGLParallelMatrix< T >::adjacency_iterator, typename ug::BGLParallelMatrix< T >::adjacency_iterator > boost::adjacent_vertices ( typename ug::BGLParallelMatrix< T >::vertex_descriptor  v,
ug::BGLParallelMatrix< T > const &  M 
)
inline

◆ coadjacent_vertices()

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 
)

◆ degree() [1/2]

template<class T >
int boost::degree ( int  v,
ug::BidirectionalMatrix< T > const &  M 
)

◆ degree() [2/2]

template<class T >
int boost::degree ( int  v,
ug::UndirectedMatrix< T > const &  M 
)

◆ get() [1/7]

template<class T >
SM_edge_weight_map< T > boost::get ( edge_weight_t  ,
ug::BGLParallelMatrix< T > const &  g 
)
inline

References incomplete.

◆ get() [2/7]

◆ get() [3/7]

template<class T >
SM_edge_weight_map< T > boost::get ( edge_weight_t  ,
ug::SparseMatrix< T > const &  g 
)
inline

◆ get() [4/7]

template<class T >
property_map< ug::BGLParallelMatrix< T >, vertex_index_t >::const_type boost::get ( vertex_index_t  ,
ug::BGLParallelMatrix< T > const &  m 
)

◆ get() [5/7]

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 
)
inline

◆ get() [6/7]

template<class T >
property_map< ug::SparseMatrix< T >, vertex_index_t >::const_type boost::get ( vertex_index_t  ,
ug::SparseMatrix< T > const &  m 
)

◆ get() [7/7]

template<class T >
property_map< ug::UndirectedMatrix< T >, vertex_index_t >::const_type boost::get ( vertex_index_t  ,
ug::UndirectedMatrix< T > const &  m 
)
inline

◆ in_degree() [1/2]

template<class T >
int boost::in_degree ( int  v,
ug::BidirectionalMatrix< T > const &  M 
)

◆ in_degree() [2/2]

template<class T >
int boost::in_degree ( int  v,
ug::UndirectedMatrix< T > const &  M 
)

References degree().

◆ in_edges()

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 
)
inline

◆ make_degree_map()

template<class T >
degree_property_map< ug::UndirectedMatrix< T > > boost::make_degree_map ( const ug::UndirectedMatrix< T > &  g)

◆ num_vertices() [1/4]

template<class T >
size_t boost::num_vertices ( ug::BGLParallelMatrix< T > const &  )

References incomplete, and num_vertices().

◆ num_vertices() [2/4]

◆ num_vertices() [3/4]

template<class T >
int boost::num_vertices ( ug::SparseMatrix< T > const &  M)

◆ num_vertices() [4/4]

template<class T >
int boost::num_vertices ( ug::UndirectedMatrix< T > const &  M)

◆ out_degree() [1/4]

◆ out_degree() [2/4]

template<class T >
int boost::out_degree ( int  v,
ug::SparseMatrix< T > const &  M 
)

References out_degree(), and out_edges().

◆ out_degree() [3/4]

template<class T >
int boost::out_degree ( int  v,
ug::UndirectedMatrix< T > const &  M 
)

References degree(), and out_degree().

◆ out_degree() [4/4]

template<class T >
int boost::out_degree ( typename ug::BGLParallelMatrix< T >::vertex_descriptor  v,
ug::BGLParallelMatrix< T > const &  M 
)

References incomplete, and out_degree().

◆ out_edges() [1/4]

template<class T >
std::pair< SM_out_edge_iterator< T >, SM_out_edge_iterator< T > > boost::out_edges ( int  v,
ug::SparseMatrix< T > const &  g 
)
inline

◆ out_edges() [2/4]

template<class T >
std::pair< UM_out_edge_iterator< T >, UM_out_edge_iterator< T > > boost::out_edges ( int  v,
ug::UndirectedMatrix< T > const &  M 
)

◆ out_edges() [3/4]

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 
)
inline

◆ out_edges() [4/4]

template<class T >
std::pair< typename ug::BGLParallelMatrix< T >::out_edge_iterator, typename ug::BGLParallelMatrix< T >::out_edge_iterator > boost::out_edges ( typename ug::BGLParallelMatrix< T >::vertex_descriptor  v,
ug::BGLParallelMatrix< T > const &  M 
)
inline

◆ source() [1/4]

template<class T , class M >
int boost::source ( SM_edge< T > const &  e,
M const &   
)

◆ source() [2/4]

template<class T >
size_t boost::source ( SM_edge< typename T::value_type > const &  e,
ug::BidirectionalMatrix< T > const &   
)

◆ source() [3/4]

template<class T >
int boost::source ( typename T::edge const &  e,
T const &   
)

References source().

◆ source() [4/4]

template<class T >
ug::BGLParallelMatrix< T >::vertex_descriptor boost::source ( typename ug::BGLParallelMatrix< T >::edge const &  e,
ug::BGLParallelMatrix< T > const &   
)

◆ target() [1/4]

template<class T , class M >
int boost::target ( SM_edge< T > const &  e,
M const &   
)

◆ target() [2/4]

template<class T >
size_t boost::target ( SM_edge< typename T::value_type > const &  e,
ug::BidirectionalMatrix< T > const &  m 
)

◆ target() [3/4]

template<class T >
int boost::target ( typename T::edge const &  e,
T const &   
)

References target().

◆ target() [4/4]

template<class T >
ug::BGLParallelMatrix< T >::vertex_descriptor boost::target ( typename ug::BGLParallelMatrix< T >::edge const &  e,
ug::BGLParallelMatrix< T > const &   
)

◆ vertices() [1/5]

template<class T >
std::pair< typename ug::BGLParallelMatrix< T >::vertex_iterator, typename ug::BGLParallelMatrix< T >::vertex_iterator > boost::vertices ( ug::BGLParallelMatrix< T > const &  M)

◆ vertices() [2/5]

◆ vertices() [3/5]

template<class T >
std::pair< counting_iterator< size_t >, counting_iterator< size_t > > boost::vertices ( ug::ParallelMatrix< ug::SparseMatrix< T > > const &  M)

References vertices().

◆ vertices() [4/5]

template<class T >
std::pair< counting_iterator< size_t >, counting_iterator< size_t > > boost::vertices ( ug::SparseMatrix< T > const &  M)

◆ vertices() [5/5]

template<class T >
std::pair< counting_iterator< size_t >, counting_iterator< size_t > > boost::vertices ( ug::UndirectedMatrix< T > const &  M)