pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init Class Reference

class for stopping when a distance/cost has being surpassed More...

Inheritance diagram for pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init:

Collaboration diagram for pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init:

Public Member Functions
	dijkstra_distance_visitor_no_init (std::ostringstream &p_log, V source, double distance_goal, std::vector< V > &predecessors, std::vector< double > &distances, std::vector< boost::default_color_type > &color_map)
template<class B_G >
void	discover_vertex (V u, B_G &)
template<class B_G >
void	edge_not_relaxed (E e, B_G &g)
template<class B_G >
void	edge_relaxed (E, B_G &)
template<class B_G >
void	examine_edge (E e, B_G &g)
template<class B_G >
void	examine_vertex (V u, B_G &)
template<class B_G >
void	finish_vertex (V, B_G &)

Private Attributes
V	first
std::ostringstream &	log
std::vector< boost::default_color_type > &	m_color
std::vector< double > &	m_dist
double	m_distance_goal
size_t	m_num_examined
std::vector< V > &	m_predecessors

Detailed Description

template<class G>
class pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init

class for stopping when a distance/cost has being surpassed

Definition at line 814 of file pgr_dijkstra.hpp.

Constructor & Destructor Documentation

dijkstra_distance_visitor_no_init()

template<class G >

pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::dijkstra_distance_visitor_no_init ( std::ostringstream &  p_log, V  source, double  distance_goal, std::vector< V > &  predecessors, std::vector< double > &  distances, std::vector< boost::default_color_type > &  color_map  )

inlineexplicit

Definition at line 817 of file pgr_dijkstra.hpp.

                                                                 :
              log(p_log),
              first(source),
              m_distance_goal(distance_goal),
              m_num_examined(0),
              m_predecessors(predecessors),
              m_dist(distances),
              m_color(color_map) {
                  pgassert(m_num_examined == 0);
                  pgassert(m_distance_goal > 0);
              }

References pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::m_distance_goal, pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::m_num_examined, and pgassert.

Member Function Documentation

discover_vertex()

template<class G >

template<class B_G >

void pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::discover_vertex ( V  u, B_G &    )

inline

Definition at line 876 of file pgr_dijkstra.hpp.

                                           {
              if (u  != first && m_predecessors[u] == u) {
                   m_color[u] = boost::black_color;
              }
          }

References pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::first, pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::m_color, and pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::m_predecessors.

edge_not_relaxed()

template<class G >

template<class B_G >

void pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::edge_not_relaxed ( E  e, B_G &  g  )

inline

Definition at line 862 of file pgr_dijkstra.hpp.

                                             {
              if (source(e, g) != first
                      && m_predecessors[source(e, g)] == source(e, g)) {
                  m_color[target(e, g)] = boost::black_color;
              }
          }

References pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::first, pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::m_color, and pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::m_predecessors.

edge_relaxed()

template<class G >

template<class B_G >

void pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::edge_relaxed ( E  , B_G &    )

inline

Definition at line 856 of file pgr_dijkstra.hpp.

                                      {
          }

examine_edge()

template<class G >

template<class B_G >

void pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::examine_edge ( E  e, B_G &  g  )

inline

Definition at line 847 of file pgr_dijkstra.hpp.

                                         {
              if (source(e, g) != first
                      && m_predecessors[source(e, g)] == source(e, g)) {
                   m_color[target(e, g)] = boost::black_color;
              }
          }

References pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::first, pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::m_color, and pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::m_predecessors.

examine_vertex()

template<class G >

template<class B_G >

void pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::examine_vertex ( V  u, B_G &    )

inline

Definition at line 836 of file pgr_dijkstra.hpp.

                                          {
              if ( 0 == m_num_examined++) first = u;
              if (m_dist[u] > m_distance_goal) {
                  throw found_goals();
              }
              if (u != first && m_predecessors[u] == u) {
                   m_color[u] = boost::black_color;
              }
          }

References pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::first, pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::m_color, pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::m_dist, pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::m_distance_goal, pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::m_num_examined, and pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::m_predecessors.

finish_vertex()

template<class G >

template<class B_G >

void pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::finish_vertex ( V  , B_G &    )

inline

Definition at line 871 of file pgr_dijkstra.hpp.

                                       {
          }

Member Data Documentation

first

template<class G >

V pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::first

private

Definition at line 884 of file pgr_dijkstra.hpp.

Referenced by pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::discover_vertex(), pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::edge_not_relaxed(), pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::examine_edge(), and pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::examine_vertex().

log

template<class G >

std::ostringstream& pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::log

private

Definition at line 883 of file pgr_dijkstra.hpp.

m_color

template<class G >

std::vector<boost::default_color_type>& pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::m_color

private

Definition at line 889 of file pgr_dijkstra.hpp.

Referenced by pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::discover_vertex(), pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::edge_not_relaxed(), pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::examine_edge(), and pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::examine_vertex().

m_dist

template<class G >

std::vector< double >& pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::m_dist

private

Definition at line 888 of file pgr_dijkstra.hpp.

Referenced by pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::examine_vertex().

m_distance_goal

template<class G >

double pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::m_distance_goal

private

Definition at line 885 of file pgr_dijkstra.hpp.

Referenced by pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::dijkstra_distance_visitor_no_init(), and pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::examine_vertex().

m_num_examined

template<class G >

size_t pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::m_num_examined

private

Definition at line 886 of file pgr_dijkstra.hpp.

Referenced by pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::dijkstra_distance_visitor_no_init(), and pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::examine_vertex().

m_predecessors

template<class G >

std::vector< V >& pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::m_predecessors

private

Definition at line 887 of file pgr_dijkstra.hpp.

Referenced by pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::discover_vertex(), pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::edge_not_relaxed(), pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::examine_edge(), and pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init::examine_vertex().

---

The documentation for this class was generated from the following file:

• pgr_dijkstra.hpp