File: ch_graphs.hpp

package info (click to toggle)
pgrouting 3.8.0-1
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 17,716 kB
  • sloc: cpp: 22,378; sql: 16,057; ansic: 9,692; perl: 1,628; sh: 867; javascript: 310; xml: 182; makefile: 29
file content (67 lines) | stat: -rw-r--r-- 1,963 bytes parent folder | download | duplicates (2)
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
/*PGR-GNU*****************************************************************
File: ch_graphs.hpp

Generated with Template by:
Copyright (c) 2015 pgRouting developers
Mail: project@pgrouting.org

Function's developer:
Copyright (c) 2016 Rohith Reddy
Mail:

------

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_CONTRACTION_CH_GRAPHS_HPP_
#define INCLUDE_CONTRACTION_CH_GRAPHS_HPP_
#pragma once


#include <limits>
#include <algorithm>
#include <vector>

#include "contraction/contractionGraph.hpp"
#include "cpp_common/base_graph.hpp"
#include "cpp_common/ch_vertex.hpp"
#include "cpp_common/ch_edge.hpp"


namespace pgrouting {
namespace graph {

using CHUndirectedGraph =  Pgr_contractionGraph <
    boost::adjacency_list < boost::listS, boost::vecS,
    boost::undirectedS,
    CH_vertex, CH_edge>, false>;

using CHUniqueUndirectedGraph =  Pgr_contractionGraph <
    boost::adjacency_list < boost::setS, boost::vecS,
    boost::undirectedS,
    CH_vertex, CH_edge>, false>;

using CHDirectedGraph = Pgr_contractionGraph<
    boost::adjacency_list < boost::listS, boost::vecS,
    boost::bidirectionalS,
    CH_vertex, CH_edge>, true>;


}  // namespace graph
}  // namespace pgrouting

#endif  // INCLUDE_CONTRACTION_CH_GRAPHS_HPP_