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
|
/*PGR-GNU*****************************************************************
File: compPaths.hpp
Copyright (c) 2015-2026 pgRouting developers
Mail: project@pgrouting.org
Class's developer:
Copyright (c) 2018 Celia Virginia Vergara Castillo
Mail: vicky@georepublic.de
------
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*/
#ifndef INCLUDE_CPP_COMMON_COMPPATHS_HPP_
#define INCLUDE_CPP_COMMON_COMPPATHS_HPP_
#pragma once
#include "cpp_common/path.hpp"
namespace pgrouting {
/*! \class compPathsLess
*
* Compares 2 paths for \b <
*
* @returns true when p1 < p2
*
* Testing takes place in the following order:
*
* - The aggregate cost is compared
* - The length is compared
* - The Node id is compared
*
*/
class compPathsLess {
public:
bool operator()(const Path &p1, const Path &p2) const;
};
} // namespace pgrouting
#endif // INCLUDE_CPP_COMMON_COMPPATHS_HPP_
|
