blob: e00a68ffbd17814079c220686120dd1e50fbc70e (
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
|
/*************************************************************************
** DependencyGraph.h **
** **
** This file is part of dvisvgm -- the DVI to SVG converter **
** Copyright (C) 2005-2015 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_H
#define DEPENDENCYGRAPH_H
#include <map>
#include <vector>
template <typename T>
class DependencyGraph
{
struct GraphNode {
typedef typename std::vector<GraphNode*> Dependees;
typedef typename Dependees::iterator Iterator;
GraphNode (const T &k) : key(k), dependent(0) {}
void addDependee (GraphNode *node) {
if (node) {
node->dependent = this;
dependees.push_back(node);
}
}
void deleteDependentsAndSelf () {
if (dependent)
dependent->deleteDependentsAndSelf();
for (typename Dependees::iterator it = dependees.begin(); it != dependees.end(); ++it)
(*it)->dependent = 0;
delete this;
}
T key;
GraphNode *dependent;
Dependees dependees;
};
typedef std::map<T, GraphNode*> NodeMap;
public:
~DependencyGraph() {
for (typename NodeMap::iterator it=_nodeMap.begin(); it != _nodeMap.end(); ++it)
delete it->second;
}
void insert (const T &key) {
if (!contains(key))
_nodeMap[key] = new GraphNode(key);
}
void insert (const T &depKey, const T &key) {
if (contains(key))
return;
typename NodeMap::iterator it = _nodeMap.find(depKey);
if (it != _nodeMap.end()) {
GraphNode *node = new GraphNode(key);
it->second->addDependee(node);
_nodeMap[key] = node;
}
}
void removeDependencyPath (const T &key) {
typename NodeMap::iterator it = _nodeMap.find(key);
if (it != _nodeMap.end()) {
GraphNode *startNode = it->second;
for (GraphNode *node=startNode; node; node=node->dependent)
_nodeMap.erase(node->key);
startNode->deleteDependentsAndSelf();
}
}
void getKeys (std::vector<T> &keys) const {
for (typename NodeMap::const_iterator it=_nodeMap.begin(); it != _nodeMap.end(); ++it)
keys.push_back(it->first);
}
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 (typename NodeMap::const_iterator 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
|