PGROUTING  2.4
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
many_to_many_withPoints_driver.cpp File Reference
#include "./many_to_many_withPoints_driver.h"
#include <algorithm>
#include <sstream>
#include <deque>
#include <vector>
#include <cassert>
#include "./pgr_dijkstra.hpp"
#include "./pgr_withPoints.hpp"
#include "./../../common/src/pgr_alloc.hpp"
#include "./../../common/src/pgr_assert.h"
#include "./../../common/src/pgr_types.h"

Go to the source code of this file.

Functions

void do_pgr_many_to_many_withPoints (pgr_edge_t *edges, size_t total_edges, Point_on_edge_t *points_p, size_t total_points, pgr_edge_t *edges_of_points, size_t total_edges_of_points, int64_t *start_pidsArr, size_t size_start_pidsArr, int64_t *end_pidsArr, size_t size_end_pidsArr, char driving_side, bool details, bool directed, bool only_cost, bool normal, General_path_element_t **return_tuples, size_t *return_count, char **log_msg, char **notice_msg, char **err_msg)
 
template<class G >
std::deque< Pathpgr_dijkstra (G &graph, std::vector< int64_t > sources, std::vector< int64_t > targets, bool only_cost, bool normal)
 

Function Documentation

void do_pgr_many_to_many_withPoints ( pgr_edge_t edges,
size_t  total_edges,
Point_on_edge_t points_p,
size_t  total_points,
pgr_edge_t edges_of_points,
size_t  total_edges_of_points,
int64_t *  start_pidsArr,
size_t  size_start_pidsArr,
int64_t *  end_pidsArr,
size_t  size_end_pidsArr,
char  driving_side,
bool  details,
bool  directed,
bool  only_cost,
bool  normal,
General_path_element_t **  return_tuples,
size_t *  return_count,
char **  log_msg,
char **  notice_msg,
char **  err_msg 
)
template<class G >
std::deque< Path > pgr_dijkstra ( G &  graph,
std::vector< int64_t >  sources,
std::vector< int64_t >  targets,
bool  only_cost,
bool  normal 
)