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
|
/*
* This file is part of the API Extractor project.
*
* Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies).
*
* Contact: PySide team <contact@pyside.org>
*
* 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
*
*/
#include "testtoposort.h"
#include <QtTest/QTest>
#include "graph.h"
#include <QDebug>
void TestTopoSort::testTopoSort()
{
QLinkedList<int> result;
{
Graph g(3);
g.addEdge(1, 2);
g.addEdge(0, 1);
result = g.topologicalSort();
QCOMPARE(result.size(), 3);
QLinkedList<int>::iterator it = result.begin();
QCOMPARE(*it, 0);
QCOMPARE(*(++it), 1);
QCOMPARE(*(++it), 2);
}
{
Graph g(2);
result = g.topologicalSort();
QCOMPARE(result.size(), 2);
QLinkedList<int>::iterator it = result.begin();
QCOMPARE(*it, 1);
QCOMPARE(*(++it), 0);
}
}
void TestTopoSort::testCiclicGraph()
{
Graph g(3);
g.addEdge(0, 1);
g.addEdge(1, 2);
g.addEdge(2, 0);
QLinkedList<int> result = g.topologicalSort();
QVERIFY(result.isEmpty());
}
QTEST_APPLESS_MAIN(TestTopoSort)
#include "testtoposort.moc"
|
