blob: bf1c1cc973764ce98bec5a1c7b23d87e3467898d (
plain)
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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
|
/*************************************************************************
** DependencyGraph.hpp **
** **
** This file is part of dvisvgm -- a fast DVI to SVG converter **
** Copyright (C) 2005-2022 Martin Gieseking <martin.gieseking@uos.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 3 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, see <http://www.gnu.org/licenses/>. **
*************************************************************************/
#ifndef DEPENDENCYGRAPH_HPP
#define DEPENDENCYGRAPH_HPP
#include <map>
#include <memory>
#include <set>
#include <vector>
#include "../utility.hpp"
template <typename T>
class DependencyGraph {
struct GraphNode {
explicit GraphNode (const T &k) : key(k), dependent() {}
void addDependee (GraphNode *node) {
if (node) {
node->dependent = this;
dependees.insert(node);
}
}
void unlinkDependees () {
for (GraphNode *dependee : dependees)
dependee->dependent = nullptr;
dependees.clear();
}
void unlinkDependee (GraphNode *dependee) {
auto it = dependees.find(dependee);
if (it != dependees.end()) {
(*it)->dependent = nullptr;
dependees.erase(it);
}
}
T key;
GraphNode *dependent;
std::set<GraphNode*> dependees;
};
using NodeMap = std::map<T, std::unique_ptr<GraphNode>>;
public:
/** Inserts a new isolated node into the dependency graph. */
void insert (const T &key) {
if (!contains(key))
_nodeMap.emplace(key, util::make_unique<GraphNode>(key));
}
/** Inserts a new node to the graph and adds a dependency on an existing one to it.
* @param[in] key ID of new node to insert
* @param[in] dependantKey ID of node the new node should depend on */
void insert (const T &dependentKey, const T &key) {
if (!contains(key)) {
auto dependentIter = _nodeMap.find(dependentKey);
if (dependentIter != _nodeMap.end()) {
auto node = util::make_unique<GraphNode>(key);
dependentIter->second->addDependee(node.get());
_nodeMap.emplace(key, std::move(node));
}
}
}
/** Removes a node and all its dependents from the graph. */
void removeDependencyPath (const T &key) {
auto it = _nodeMap.find(key);
if (it != _nodeMap.end()) {
for (GraphNode *node = it->second.get(); node;) {
GraphNode *dependent = node->dependent;
node->unlinkDependees();
if (dependent)
dependent->unlinkDependee(node);
_nodeMap.erase(node->key);
node = dependent;
}
}
}
/** Returns the IDs of all nodes present in the graph. */
std::vector<T> getKeys () const {
std::vector<T> keys;
for (auto &entry : _nodeMap)
keys.emplace_back(entry.first);
return keys;
}
bool contains (const T &value) const {
return _nodeMap.find(value) != _nodeMap.end();
}
bool empty () const {
return _nodeMap.empty();
}
#if 0
void writeDOT (std::ostream &os) const {
os << "digraph {\n";
for (auto it=_nodeMap.begin(); it != _nodeMap.end(); ++it) {
GraphNode *node = it->second;
if (node->dependent)
os << (node->key) << " -> " << (node->dependent->key) << ";\n";
else if (node->dependees.empty())
os << (node->key) << ";\n";
}
os << "}\n";
}
#endif
private:
NodeMap _nodeMap;
};
#endif
|
