forked from onnx/onnx-tensorrt
-
Notifications
You must be signed in to change notification settings - Fork 0
/
toposort.hpp
98 lines (90 loc) · 3.41 KB
/
toposort.hpp
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
87
88
89
90
91
92
93
94
95
96
97
98
/*
* Copyright (c) 2018, NVIDIA CORPORATION. All rights reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE.
*/
#pragma once
#include <vector>
#include <unordered_map>
#include <iostream>
using std::cout;
using std::cerr;
using std::endl;
namespace {
enum NodeState { NODE_UNVISITED, NODE_ACTIVE, NODE_VISITED };
template<class Container>
bool get_post_order(size_t node_idx,
Container const& nodes,
std::unordered_map<std::string, size_t> const& node_map,
std::vector<NodeState>* node_states,
std::vector<size_t>* order) {
NodeState& node_state = node_states->at(node_idx);
if( node_state == NODE_ACTIVE ) {
// Cycle detected!
cerr << "ERROR: Graph contains a cycle" << endl;
return false;
} else if( node_state == NODE_VISITED ) {
return true;
} else {
node_state = NODE_ACTIVE;
// TODO: This .Get().input() is highly specific to protobuf, should
// generalise it somehow.
for( auto const& input : nodes.Get(node_idx).input() ) {
if( !node_map.count(input) ) {
// Input node not found in graph!
//cerr << "ERROR: Input node not found in graph: "
// << input << endl;
//return false;
continue; // Skip missing input edges
}
size_t input_node_idx = node_map.at(input);
if( !get_post_order(input_node_idx, nodes, node_map, node_states, order) ) {
return false;
}
}
node_state = NODE_VISITED;
order->push_back(node_idx);
}
return true;
}
} // anonymous namespace
template<class Container>
bool toposort(Container const& nodes, std::vector<size_t>* order) {
std::unordered_map<std::string, size_t> node_map;
for( size_t i=0; i<(size_t)nodes.size(); ++i ) {
// TODO: This .Get().input() is highly specific to protobuf, should
// generalise it somehow.
for( auto const& output : nodes.Get(i).output() ) {
if( !node_map.emplace(output, i).second ) {
// Output name appears more than once in graph!
cerr << "ERROR: Output name is not unique: "
<< output << endl;
return false;
}
}
}
order->reserve(nodes.size());
std::vector<NodeState> node_states(nodes.size(), NODE_UNVISITED);
for( size_t i=0; i<(size_t)nodes.size(); ++i ) {
if( !get_post_order(i, nodes, node_map, &node_states, order) ) {
return false;
}
}
return true;
}