1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
|
/*PGR-GNU*****************************************************************
*
Copyright (c) 2015 Celia Virginia Vergara Castillo
vicky_vergara@hotmail.com
------
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
********************************************************************PGR-GNU*/
/*! @file */
#ifndef INCLUDE_CPP_COMMON_BASIC_VERTEX_H_
#define INCLUDE_CPP_COMMON_BASIC_VERTEX_H_
#pragma once
#include <vector>
#include <ostream>
#include "c_types/edge_t.h"
namespace pgrouting {
class Basic_vertex {
public:
Basic_vertex() :
id(0) {}
Basic_vertex(const Basic_vertex &v) :
id(v.id) {}
explicit Basic_vertex(const int64_t _id) :
id(_id) {}
Basic_vertex& operator=(const Basic_vertex&) = default;
Basic_vertex(const Edge_t &other, bool is_source) :
id(is_source? other.source : other.target) {}
void cp_members(const Basic_vertex &other) {
this->id = other.id;
}
friend std::ostream& operator<<(std::ostream& log, const Basic_vertex &v);
public:
int64_t id;
size_t vertex_index;
};
size_t check_vertices(std::vector < Basic_vertex > vertices);
std::vector < Basic_vertex > extract_vertices(
std::vector < Basic_vertex > vertices,
const Edge_t *data_edges, size_t count);
std::vector < Basic_vertex > extract_vertices(
std::vector < Basic_vertex > vertices,
const std::vector < Edge_t > data_edges);
std::vector < Basic_vertex > extract_vertices(
const Edge_t *data_edges, size_t count);
std::vector < Basic_vertex > extract_vertices(
const std::vector < Edge_t > &data_edges);
} // namespace pgrouting
#endif // INCLUDE_CPP_COMMON_BASIC_VERTEX_H_
|
