aboutsummaryrefslogtreecommitdiffstats log msg author committer range
path: root/graph.h
 ```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 ``` ``````/* * This file is part of the API Extractor project. * * Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies). * * Contact: PySide team * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * version 2 as published by the Free Software Foundation. * * 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, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA * 02110-1301 USA * */ #ifndef GRAPH_H #define GRAPH_H #include #include #include #include "apiextractormacros.h" /// A graph that can have their nodes topologically sorted. class APIEXTRACTOR_API Graph { public: /// Create a new graph with \p numNodes nodes. Graph(int numNodes); ~Graph(); /// Returns the numbed of nodes in this graph. int nodeCount() const; /// Returns true if the graph contains the edge from -> to bool containsEdge(int from, int to); /// Adds an edge to this graph. void addEdge(int from, int to); /// Removes an edge out of this graph. void removeEdge(int from, int to); /// Print this graph to stdout. void dump() const; /** * Dumps a dot graph to a file named \p filename. * \param nodeNames map used to translate node ids to human readable text. * \param fileName file name where the output should be written. */ void dumpDot(const QHash& nodeNames, const QString& fileName) const; /** * Topologically sort this graph. * \return A collection with all nodes topologically sorted or an empty collection if a ciclic dependency was found. */ QLinkedList topologicalSort() const; private: struct GraphPrivate; GraphPrivate* m_d; }; #endif ``````