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
| //=== llvm/unittest/ADT/BreadthFirstIteratorTest.cpp - BFS iterator tests -===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
#include "llvm/ADT/BreadthFirstIterator.h"
#include "TestGraph.h"
#include "gtest/gtest.h"
using namespace llvm;
namespace llvm {
TEST(BreadthFristIteratorTest, Basic) {
typedef bf_iterator<Graph<4>> BFIter;
Graph<4> G;
G.AddEdge(0, 1);
G.AddEdge(0, 2);
G.AddEdge(1, 3);
auto It = BFIter::begin(G);
auto End = BFIter::end(G);
EXPECT_EQ(It.getLevel(), 0U);
EXPECT_EQ(*It, G.AccessNode(0));
++It;
EXPECT_EQ(It.getLevel(), 1U);
EXPECT_EQ(*It, G.AccessNode(1));
++It;
EXPECT_EQ(It.getLevel(), 1U);
EXPECT_EQ(*It, G.AccessNode(2));
++It;
EXPECT_EQ(It.getLevel(), 2U);
EXPECT_EQ(*It, G.AccessNode(3));
++It;
EXPECT_EQ(It, End);
}
TEST(BreadthFristIteratorTest, Cycle) {
typedef bf_iterator<Graph<4>> BFIter;
Graph<4> G;
G.AddEdge(0, 1);
G.AddEdge(1, 0);
G.AddEdge(1, 2);
G.AddEdge(2, 1);
G.AddEdge(2, 1);
G.AddEdge(2, 3);
G.AddEdge(3, 2);
G.AddEdge(3, 1);
G.AddEdge(3, 0);
auto It = BFIter::begin(G);
auto End = BFIter::end(G);
EXPECT_EQ(It.getLevel(), 0U);
EXPECT_EQ(*It, G.AccessNode(0));
++It;
EXPECT_EQ(It.getLevel(), 1U);
EXPECT_EQ(*It, G.AccessNode(1));
++It;
EXPECT_EQ(It.getLevel(), 2U);
EXPECT_EQ(*It, G.AccessNode(2));
++It;
EXPECT_EQ(It.getLevel(), 3U);
EXPECT_EQ(*It, G.AccessNode(3));
++It;
EXPECT_EQ(It, End);
}
} // end namespace llvm
|