#include "pgr_bidirectional.hpp"

Inheritance diagram for pgrouting::bidirectional::Pgr_bidirectional< G >:

Collaboration diagram for pgrouting::bidirectional::Pgr_bidirectional< G >:

[legend]

Public Member Functions
	Pgr_bidirectional (G &pgraph)

	~Pgr_bidirectional ()=default

void	clean_log ()

void	clear ()

std::string	log () const

Protected Types
typedef std::pair< double, V >	Cost_Vertex_pair

typedef G::E	E

typedef std::priority_queue< Cost_Vertex_pair, std::vector< Cost_Vertex_pair >, std::greater< Cost_Vertex_pair > >	Priority_queue

typedef G::V	V

Protected Member Functions
Path	bidirectional (bool only_cost)

virtual void	explore_backward (const Cost_Vertex_pair &node)=0

virtual void	explore_forward (const Cost_Vertex_pair &node)=0

bool	found (const V &node)

void	initialize ()

Protected Attributes
std::vector< double >	backward_cost

std::vector< int64_t >	backward_edge

std::vector< bool >	backward_finished

std::vector< V >	backward_predecessor

Priority_queue	backward_queue

double	best_cost

bool	cost_only

std::vector< double >	forward_cost

std::vector< int64_t >	forward_edge

std::vector< bool >	forward_finished

std::vector< V >	forward_predecessor

Priority_queue	forward_queue

G &	graph

double	INF
	infinity More...

std::ostringstream	m_log

V	v_min_node
	target descriptor More...

V	v_source
	source descriptor More...

V	v_target
	target descriptor More...

Detailed Description

template<typename G>
class pgrouting::bidirectional::Pgr_bidirectional< G >

Definition at line 62 of file pgr_bidirectional.hpp.

Member Typedef Documentation

◆ Cost_Vertex_pair

template<typename G >

typedef std::pair<double, V> pgrouting::bidirectional::Pgr_bidirectional< G >::Cost_Vertex_pair

protected

Definition at line 67 of file pgr_bidirectional.hpp.

◆ E

template<typename G >

typedef G::E pgrouting::bidirectional::Pgr_bidirectional< G >::E

protected

Definition at line 65 of file pgr_bidirectional.hpp.

◆ Priority_queue

template<typename G >

typedef std::priority_queue< Cost_Vertex_pair, std::vector<Cost_Vertex_pair>, std::greater<Cost_Vertex_pair> > pgrouting::bidirectional::Pgr_bidirectional< G >::Priority_queue

protected

Definition at line 71 of file pgr_bidirectional.hpp.

◆ V

template<typename G >

typedef G::V pgrouting::bidirectional::Pgr_bidirectional< G >::V

protected

Definition at line 64 of file pgr_bidirectional.hpp.

Constructor & Destructor Documentation

◆ Pgr_bidirectional()

template<typename G >

pgrouting::bidirectional::Pgr_bidirectional< G >::Pgr_bidirectional ( G & pgraph )

inlineexplicit

Definition at line 75 of file pgr_bidirectional.hpp.

                                          :
         graph(pgraph),
         INF((std::numeric_limits<double>::max)()),
         best_cost(0) {
         m_log << "constructor\n";
     }

References pgrouting::bidirectional::Pgr_bidirectional< G >::m_log.

◆ ~Pgr_bidirectional()

template<typename G >

pgrouting::bidirectional::Pgr_bidirectional< G >::~Pgr_bidirectional ( )

default

Member Function Documentation

◆ bidirectional()

template<typename G >

Path pgrouting::bidirectional::Pgr_bidirectional< G >::bidirectional ( bool only_cost )

inlineprotected

Definition at line 122 of file pgr_bidirectional.hpp.

                                        {
         m_log << "bidir_astar\n";
  
         Pgr_bidirectional< G >::initialize();
  
         forward_cost[v_source] = 0;
         forward_queue.push(std::make_pair(0.0, v_source));
  
  
         backward_cost[v_target] = 0;
         backward_queue.push(std::make_pair(0.0, v_target));
  
         while (!forward_queue.empty() &&  !backward_queue.empty()) {
             auto forward_node = forward_queue.top();
             auto backward_node = backward_queue.top();
             /*
              * done: there is no path with lower cost
              */
             if (forward_node.first == INF || backward_node.first == INF) {
                 break;
             }
  
             /*
              * Explore from the cheapest side
              */
             if (backward_node.first < forward_node.first) {
                 backward_queue.pop();
                 if (!backward_finished[backward_node.second]) {
                     explore_backward(backward_node);
                 }
                 if (found(backward_node.second)) {
                     break;
                 }
             } else {
                 forward_queue.pop();
                 if (!forward_finished[forward_node.second]) {
                     explore_forward(forward_node);
                 }
                 if (found(forward_node.second)) {
                     break;
                 }
             }
         }
  
         if (best_cost == INF) return Path();
  
         Path forward_path(
                 graph,
                 v_source,
                 v_min_node,
                 forward_predecessor,
                 forward_cost,
                 false,
                 true);
         Path backward_path(
                 graph,
                 v_target,
                 v_min_node,
                 backward_predecessor,
                 backward_cost,
                 false,
                 false);
         m_log << forward_path;
         backward_path.reverse();
         m_log << backward_path;
         forward_path.append(backward_path);
         auto p = Path(graph, forward_path, only_cost);
         m_log << forward_path;
         m_log << p;
         return p;
     }

Referenced by pgrouting::bidirectional::Pgr_bdAstar< G >::pgr_bdAstar(), and pgrouting::bidirectional::Pgr_bdDijkstra< G >::pgr_bdDijkstra().

◆ clean_log()

template<typename G >

void pgrouting::bidirectional::Pgr_bidirectional< G >::clean_log ( )

inline

Definition at line 85 of file pgr_bidirectional.hpp.

85 {m_log.clear();}

References pgrouting::bidirectional::Pgr_bidirectional< G >::m_log.

◆ clear()

template<typename G >

void pgrouting::bidirectional::Pgr_bidirectional< G >::clear ( )

inline

Definition at line 86 of file pgr_bidirectional.hpp.

                  {
         while (!forward_queue.empty()) forward_queue.pop();
         while (!backward_queue.empty()) backward_queue.pop();
  
         backward_finished.clear();
         backward_edge.clear();
         backward_predecessor.clear();
         backward_cost.clear();
  
         forward_finished.clear();
         forward_edge.clear();
         forward_predecessor.clear();
         forward_cost.clear();
     }

Referenced by pgrouting::bidirectional::Pgr_bidirectional< G >::initialize(), pgr_bdAstar(), and pgr_bdDijkstra().

◆ explore_backward()

template<typename G >

virtual void pgrouting::bidirectional::Pgr_bidirectional< G >::explore_backward ( const Cost_Vertex_pair & node )

protectedpure virtual

Implemented in pgrouting::bidirectional::Pgr_bdAstar< G >, and pgrouting::bidirectional::Pgr_bdDijkstra< G >.

Referenced by pgrouting::bidirectional::Pgr_bidirectional< G >::bidirectional().

◆ explore_forward()

template<typename G >

virtual void pgrouting::bidirectional::Pgr_bidirectional< G >::explore_forward ( const Cost_Vertex_pair & node )

protectedpure virtual

Implemented in pgrouting::bidirectional::Pgr_bdAstar< G >, and pgrouting::bidirectional::Pgr_bdDijkstra< G >.

Referenced by pgrouting::bidirectional::Pgr_bidirectional< G >::bidirectional().

◆ found()

template<typename G >

bool pgrouting::bidirectional::Pgr_bidirectional< G >::found ( const V & node )

inlineprotected

Definition at line 196 of file pgr_bidirectional.hpp.

                               {
         /*
          * Update common node
          */
         if (forward_finished[node] && backward_finished[node]) {
             if (best_cost >= forward_cost[node] + backward_cost[node]) {
                 v_min_node = node;
                 best_cost =  forward_cost[node] + backward_cost[node];
                 return false;
             } else {
                 return true;
             }
         }
         return false;
     }

References pgrouting::bidirectional::Pgr_bidirectional< G >::backward_cost, pgrouting::bidirectional::Pgr_bidirectional< G >::backward_finished, pgrouting::bidirectional::Pgr_bidirectional< G >::best_cost, pgrouting::bidirectional::Pgr_bidirectional< G >::forward_cost, pgrouting::bidirectional::Pgr_bidirectional< G >::forward_finished, and pgrouting::bidirectional::Pgr_bidirectional< G >::v_min_node.

Referenced by pgrouting::bidirectional::Pgr_bidirectional< G >::bidirectional().

◆ initialize()

template<typename G >

void pgrouting::bidirectional::Pgr_bidirectional< G >::initialize ( )

inlineprotected

Definition at line 103 of file pgr_bidirectional.hpp.

                       {
         m_log << "initializing\n";
         clear();
         forward_predecessor.resize(graph.num_vertices());
         forward_finished.resize(graph.num_vertices(), false);
         forward_edge.resize(graph.num_vertices(), -1);
         forward_cost.resize(graph.num_vertices(), INF);
         std::iota(forward_predecessor.begin(), forward_predecessor.end(), 0);
  
         backward_predecessor.resize(graph.num_vertices());
         backward_finished.resize(graph.num_vertices(), false);
         backward_edge.resize(graph.num_vertices(), -1);
         backward_cost.resize(graph.num_vertices(), INF);
         std::iota(backward_predecessor.begin(), backward_predecessor.end(), 0);
  
         v_min_node = 0;
         best_cost = INF;
     }