-
-
Notifications
You must be signed in to change notification settings - Fork 395
Expand file tree
/
Copy pathtopologicalSort.cpp
More file actions
71 lines (52 loc) · 1.95 KB
/
Copy pathtopologicalSort.cpp
File metadata and controls
71 lines (52 loc) · 1.95 KB
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
/*PGR-GNU*****************************************************************
File: topologicalSort.cpp
Copyright (c) 2015-2026 pgRouting developers
Mail: project@pgrouting.org
Function's developer:
Copyright (c) 2019 Hang Wu
mail: nike0good@gmail.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*/
#include "ordering/topologicalSort.hpp"
#include <vector>
#include <algorithm>
#include <string>
#include <cstdint>
#include <boost/config.hpp>
#include "cpp_common/base_graph.hpp"
#include "cpp_common/interruption.hpp"
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/topological_sort.hpp>
namespace pgrouting {
namespace functions {
std::vector<pgrouting::DirectedGraph::V>
topologicalSort(const pgrouting::DirectedGraph &graph) {
using V = typename pgrouting::DirectedGraph::V;
std::vector<V> results;
CHECK_FOR_INTERRUPTS();
try {
boost::topological_sort(graph.graph, std::back_inserter(results));
} catch (boost::exception const& ex) {
throw std::string("Graph is not DAG");
} catch (std::exception &e) {
(void)e;
throw;
} catch (...) {
throw;
}
std::reverse(results.begin(), results.end());
return results;
}
} // namespace functions
} // namespace pgrouting