Boost  v1.57.0
doxygen for www.boost.org
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
Public Member Functions | Public Attributes | List of all members
boost::r_c_shortest_paths_label< Graph, Resource_Container > Struct Template Reference

#include <r_c_shortest_paths.hpp>

Collaboration diagram for boost::r_c_shortest_paths_label< Graph, Resource_Container >:
Collaboration graph
[legend]

Public Member Functions

 r_c_shortest_paths_label (const unsigned long n, const Resource_Container &rc=Resource_Container(), const r_c_shortest_paths_label *const pl=0, const typename graph_traits< Graph >::edge_descriptor &ed=graph_traits< Graph >::edge_descriptor(), const typename graph_traits< Graph >::vertex_descriptor &vd=graph_traits< Graph >::vertex_descriptor())
 
r_c_shortest_paths_label & operator= (const r_c_shortest_paths_label &other)
 

Public Attributes

const unsigned long num
 
Resource_Container cumulated_resource_consumption
 
const r_c_shortest_paths_label
*const 		p_pred_label
 
const graph_traits< Graph >
::edge_descriptor 		pred_edge
 
const graph_traits< Graph >
::vertex_descriptor 		resident_vertex
 
bool b_is_dominated
 
bool b_is_processed
 
bool b_is_valid
 

Constructor & Destructor Documentation

template<class Graph, class Resource_Container>
boost::r_c_shortest_paths_label< Graph, Resource_Container >::r_c_shortest_paths_label ( const unsigned long  n,
const Resource_Container &  rc = Resource_Container(),
const r_c_shortest_paths_label< Graph, Resource_Container > *const  pl = 0,
const typename graph_traits< Graph >::edge_descriptor &  ed = graph_traits<Graph>::edge_descriptor(),
const typename graph_traits< Graph >::vertex_descriptor &  vd = graph_traits<Graph>::vertex_descriptor() 
)
inline

Referenced by boost::r_c_shortest_paths_label< Graph, Resource_Container >::operator=().

Member Function Documentation

template<class Graph, class Resource_Container>
r_c_shortest_paths_label& boost::r_c_shortest_paths_label< Graph, Resource_Container >::operator= ( const r_c_shortest_paths_label< Graph, Resource_Container > &  other)
inline

References boost::r_c_shortest_paths_label< Graph, Resource_Container >::r_c_shortest_paths_label(), and boost::multiprecision::backends::this.

Member Data Documentation

template<class Graph, class Resource_Container>
bool boost::r_c_shortest_paths_label< Graph, Resource_Container >::b_is_dominated
template<class Graph, class Resource_Container>
bool boost::r_c_shortest_paths_label< Graph, Resource_Container >::b_is_processed
template<class Graph, class Resource_Container>
bool boost::r_c_shortest_paths_label< Graph, Resource_Container >::b_is_valid

Referenced by boost::operator!=(), boost::operator<(), boost::operator<=(), boost::operator==(), boost::operator>(), boost::operator>=(), and boost::detail::r_c_shortest_paths_dispatch().

template<class Graph, class Resource_Container>
Resource_Container boost::r_c_shortest_paths_label< Graph, Resource_Container >::cumulated_resource_consumption

Referenced by boost::operator<(), boost::operator==(), boost::operator>(), and boost::detail::r_c_shortest_paths_dispatch().

template<class Graph, class Resource_Container>
const unsigned long boost::r_c_shortest_paths_label< Graph, Resource_Container >::num

Referenced by boost::detail::r_c_shortest_paths_dispatch().

template<class Graph, class Resource_Container>
const r_c_shortest_paths_label* const boost::r_c_shortest_paths_label< Graph, Resource_Container >::p_pred_label

Referenced by boost::detail::r_c_shortest_paths_dispatch().

template<class Graph, class Resource_Container>
const graph_traits<Graph>::edge_descriptor boost::r_c_shortest_paths_label< Graph, Resource_Container >::pred_edge

Referenced by boost::detail::r_c_shortest_paths_dispatch().

template<class Graph, class Resource_Container>
const graph_traits<Graph>::vertex_descriptor boost::r_c_shortest_paths_label< Graph, Resource_Container >::resident_vertex
The documentation for this struct was generated from the following file: