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
134
135
136
137
138
139
140
141
142
143
144
145
|
/**************************************************************************
**
** Copyright (C) 2017 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of the Qt Installer Framework.
**
** $QT_BEGIN_LICENSE:GPL-EXCEPT$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and The Qt Company. For licensing terms
** and conditions see https://www.qt.io/terms-conditions. For further
** information use the contact form at https://www.qt.io/contact-us.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3 as published by the Free Software
** Foundation with exceptions as appearing in the file LICENSE.GPL3-EXCEPT
** included in the packaging of this file. Please review the following
** information to ensure the GNU General Public License requirements will
** be met: https://www.gnu.org/licenses/gpl-3.0.html.
**
** $QT_END_LICENSE$
**
**************************************************************************/
#ifndef GRAPH_H
#define GRAPH_H
#include <QHash>
#include <QList>
#include <QPair>
#include <QSet>
namespace QInstaller {
template <class T> class Graph
{
public:
inline Graph() {}
explicit Graph(const QList<T> &nodes)
{
addNodes(nodes);
}
const QList<T> nodes() const
{
return m_graph.keys();
}
void addNode(const T &node)
{
m_graph.insert(node, QSet<T>());
}
void addNodes(const QList<T> &nodes)
{
foreach (const T &node, nodes)
addNode(node);
}
QList<T> edges(const T &node) const
{
return m_graph.value(node).values();
}
void addEdge(const T &node, const T &edge)
{
m_graph[node].insert(edge);
}
void addEdges(const T &node, const QList<T> &edges)
{
foreach (const T &edge, edges)
addEdge(node, edge);
}
bool hasCycle() const
{
return m_hasCycle;
}
QPair<T, T> cycle() const
{
return m_cycle;
}
QList<T> sort() const
{
QSet<T> visitedNodes;
QList<T> resolvedNodes;
m_hasCycle = false;
m_cycle = qMakePair(T(), T());
foreach (const T &node, nodes())
visit(node, &resolvedNodes, &visitedNodes);
return resolvedNodes;
}
QList<T> sortReverse() const
{
QList<T> result = sort();
std::reverse(result.begin(), result.end());
return result;
}
private:
void visit(const T &node, QList<T> *const resolvedNodes, QSet<T> *const visitedNodes) const
{
if (m_hasCycle)
return;
// if we visited this node already
if (visitedNodes->contains(node)) {
// and if the node is already in the ordered list
if (resolvedNodes->contains(node))
return;
m_hasCycle = true;
m_cycle.second = node;
return; // if not yet in the ordered list, we detected a cycle
}
// mark this node as visited
visitedNodes->insert(node);
m_cycle.first = node;
// recursively visit all adjacency
foreach (const T &adjacency, edges(node))
visit(adjacency, resolvedNodes, visitedNodes);
// append this node to the ordered list
resolvedNodes->append(node);
}
private:
mutable bool m_hasCycle;
QHash<T, QSet<T> > m_graph;
mutable QPair<T,T> m_cycle;
};
}
#endif // GRAPH_H
|
