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

class for stopping when all targets are found More...

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

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

Public Member Functions
	dijkstra_many_goal_visitor (const std::set< V > &goals, size_t n_goals, std::set< V > &f_goals)
template<class B_G >
void	examine_vertex (V u, B_G &)

Private Attributes
std::set< V > &	m_found_goals
std::set< V >	m_goals
size_t	m_n_goals

Detailed Description

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

class for stopping when all targets are found

Definition at line 750 of file pgr_dijkstra.hpp.

Constructor & Destructor Documentation

dijkstra_many_goal_visitor()

template<class G >

pgrouting::Pgr_dijkstra< G >::dijkstra_many_goal_visitor::dijkstra_many_goal_visitor ( const std::set< V > &  goals, size_t  n_goals, std::set< V > &  f_goals  )

inline

Definition at line 752 of file pgr_dijkstra.hpp.

                                      :
              m_goals(goals),
              m_n_goals(n_goals),
              m_found_goals(f_goals)   {
              }

Member Function Documentation

examine_vertex()

template<class G >

template<class B_G >

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

inline

Definition at line 761 of file pgr_dijkstra.hpp.

                                              {
                  auto s_it = m_goals.find(u);
 
                  /* examined vertex is not a goal */
                  if (s_it == m_goals.end()) return;
 
                  // found one more goal
                  m_found_goals.insert(*s_it);
                  m_goals.erase(s_it);
 
                  // all goals found
                  if (m_goals.size() == 0) throw found_goals();
 
                  // number of requested goals found
                  --m_n_goals;
                  if (m_n_goals == 0) throw found_goals();
              }

References pgrouting::Pgr_dijkstra< G >::dijkstra_many_goal_visitor::m_found_goals, pgrouting::Pgr_dijkstra< G >::dijkstra_many_goal_visitor::m_goals, and pgrouting::Pgr_dijkstra< G >::dijkstra_many_goal_visitor::m_n_goals.

Member Data Documentation

m_found_goals

template<class G >

std::set< V >& pgrouting::Pgr_dijkstra< G >::dijkstra_many_goal_visitor::m_found_goals

private

Definition at line 782 of file pgr_dijkstra.hpp.

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

m_goals

template<class G >

std::set< V > pgrouting::Pgr_dijkstra< G >::dijkstra_many_goal_visitor::m_goals

private

Definition at line 780 of file pgr_dijkstra.hpp.

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

m_n_goals

template<class G >

size_t pgrouting::Pgr_dijkstra< G >::dijkstra_many_goal_visitor::m_n_goals

private

Definition at line 781 of file pgr_dijkstra.hpp.

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

---

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

• pgr_dijkstra.hpp