pgRouting
pgRouting extends the PostGIS / PostgreSQL geospatial database to provide geospatial routing functionality.
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
pgr_withPoints.hpp
Go to the documentation of this file.
1 /*PGR-GNU*****************************************************************
2 File: withPoints_driver.h
3 
4 Copyright (c) 2015 pgRouting developers
5 Mail: project@pgrouting.org
6 
7 Function's developer:
8 Copyright (c) 2015 Celia Virginia Vergara Castillo
9 Mail:
10 
11 ------
12 
13 This program is free software; you can redistribute it and/or modify
14 it under the terms of the GNU General Public License as published by
15 the Free Software Foundation; either version 2 of the License, or
16 (at your option) any later version.
17 
18 This program is distributed in the hope that it will be useful,
19 but WITHOUT ANY WARRANTY; without even the implied warranty of
20 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
21 GNU General Public License for more details.
22 
23 You should have received a copy of the GNU General Public License
24 along with this program; if not, write to the Free Software
25 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
26 
27 ********************************************************************PGR-GNU*/
28 
29 #pragma once
30 #include <vector>
31 
32 #include "./../../common/src/pgr_types.h"
33 #include "./../../common/src/basePath_SSEC.hpp"
34 
35 int
36 check_points(std::vector< Point_on_edge_t > &points,
37  std::ostringstream &log);
38 
39 void
41  Path &path);
42 
43 void
45  Path &path,
46  const std::vector< pgr_edge_t > &point_edges);
47 
48 void
50  const std::vector< Point_on_edge_t > &points,
51  Path &path);
52 
53 
54 bool
56  std::vector< Point_on_edge_t > &points,
57  const std::vector< pgr_edge_t > &edges,
58  char driving_side,
59  std::vector< pgr_edge_t > &new_edges);
60 
61 bool
63  std::vector< Point_on_edge_t > &points,
64  const std::vector< pgr_edge_t > &edges,
65  char driving_side,
66  std::vector< pgr_edge_t > &new_edges,
67  std::ostringstream &log);
int check_points(std::vector< Point_on_edge_t > &points, std::ostringstream &log)
void eliminate_details_dd(Path &path)
void eliminate_details(Path &path, const std::vector< pgr_edge_t > &point_edges)
edge_astar_t * edges
Definition: BDATester.cpp:46
void adjust_pids(const std::vector< Point_on_edge_t > &points, Path &path)
path_element_t * path
Definition: BDATester.cpp:49
bool create_new_edges(std::vector< Point_on_edge_t > &points, const std::vector< pgr_edge_t > &edges, char driving_side, std::vector< pgr_edge_t > &new_edges)