1 files changed, 0 insertions, 134 deletions
diff --git a/sources/shiboken2/ApiExtractor/graph.cpp b/sources/shiboken2/ApiExtractor/graph.cpp
deleted file mode 100644
index 53e20ebba..000000000
--- a/sources/shiboken2/ApiExtractor/graph.cpp
+++ /dev/null
@@ -1,134 +0,0 @@
-/****************************************************************************
-**
-** Copyright (C) 2016 The Qt Company Ltd.
-** Contact: https://www.qt.io/licensing/
-**
-** This file is part of Qt for Python.
-**
-** $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$
-**
-****************************************************************************/
-
-#include "graph.h"
-#include <QVector>
-#include <QDebug>
-#include <QSet>
-#include <iterator>
-#include <algorithm>
-#include <iostream>
-#include <QFile>
-
-struct Graph::GraphPrivate
-{
-    enum Color { WHITE, GRAY, BLACK };
-    using Edges = QVector<QSet<int> >;
-
-    Edges edges;
-
-    GraphPrivate(int numNodes) : edges(numNodes)
-    {
-    }
-
-    void dfsVisit(int node, Graph::Indexes &result, QVector<Color> &colors) const
-    {
-        colors[node] = GRAY;
-        for (const auto &c : edges.at(node)) {
-            if (colors[c] == WHITE)
-                dfsVisit(c, result, colors);
-            else if (colors[c] == GRAY) // This is not a DAG!
-                return;
-        }
-        colors[node] = BLACK;
-        result.append(node);
-    }
-};
-
-Graph::Graph(int numNodes) : m_d(new GraphPrivate(numNodes))
-{
-}
-
-Graph::~Graph()
-{
-    delete m_d;
-}
-
-int Graph::nodeCount() const
-{
-    return m_d->edges.size();
-}
-
-Graph::Indexes Graph::topologicalSort() const
-{
-    const int nodeCount = Graph::nodeCount();
-    Indexes result;
-    result.reserve(nodeCount);
-
-    QVector<GraphPrivate::Color> colors(nodeCount, GraphPrivate::WHITE);
-
-    for (int i = 0; i < nodeCount; ++i) {
-        if (colors[i] == GraphPrivate::WHITE)
-            m_d->dfsVisit(i, result, colors);
-    }
-
-    if (result.size() == nodeCount)
-        std::reverse(result.begin(), result.end());
-    else
-        result.clear(); // Not a DAG!
-    return result;
-}
-
-bool Graph::containsEdge(int from, int to)
-{
-    return m_d->edges[from].contains(to);
-}
-
-void Graph::addEdge(int from, int to)
-{
-    Q_ASSERT(to < m_d->edges.size());
-    m_d->edges[from].insert(to);
-}
-
-void Graph::removeEdge(int from, int to)
-{
-    m_d->edges[from].remove(to);
-}
-
-void Graph::dump() const
-{
-    for (int i = 0; i < m_d->edges.size(); ++i) {
-        std::cout << i << " -> ";
-        std::copy(m_d->edges[i].begin(), m_d->edges[i].end(), std::ostream_iterator<int>(std::cout, " "));
-        std::cout << std::endl;
-    }
-}
-
-void Graph::dumpDot(const QHash< int, QString >& nodeNames, const QString& fileName) const
-{
-    QFile output(fileName);
-    if (!output.open(QIODevice::WriteOnly))
-        return;
-    QTextStream s(&output);
-    s << "digraph D {\n";
-    for (int i = 0; i < m_d->edges.size(); ++i) {
-        for (auto it = m_d->edges[i].cbegin(), end = m_d->edges[i].cend(); it != end; ++it)
-            s << '"' << nodeNames[i] << "\" -> \"" << nodeNames[*it] << "\"\n";
-    }
-    s << "}\n";
-}