-
Notifications
You must be signed in to change notification settings - Fork 294
/
Copy pathBreadthFirst_Tests.cs
74 lines (60 loc) · 2.1 KB
/
BreadthFirst_Tests.cs
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
using Advanced.Algorithms.DataStructures.Graph.AdjacencyList;
using Advanced.Algorithms.Graph;
using Microsoft.VisualStudio.TestTools.UnitTesting;
namespace Advanced.Algorithms.Tests.Graph
{
[TestClass]
public class BreadFirstTests
{
[TestMethod]
public void BreadthFirst_AdjacencyListGraph_Smoke_Test()
{
var graph = new Graph<char>();
graph.AddVertex('A');
graph.AddVertex('B');
graph.AddVertex('C');
graph.AddVertex('D');
graph.AddVertex('E');
graph.AddVertex('F');
graph.AddVertex('G');
graph.AddVertex('H');
graph.AddVertex('I');
graph.AddEdge('A', 'B');
graph.AddEdge('B', 'C');
graph.AddEdge('C', 'D');
graph.AddEdge('D', 'E');
graph.AddEdge('E', 'F');
graph.AddEdge('F', 'G');
graph.AddEdge('G', 'H');
graph.AddEdge('H', 'I');
var algorithm = new BreadthFirst<char>();
Assert.IsTrue(algorithm.Find(graph, 'D'));
Assert.IsFalse(algorithm.Find(graph, 'M'));
}
[TestMethod]
public void BreadthFirst_AdjacencyMatrixGraph_Smoke_Test()
{
var graph = new Algorithms.DataStructures.Graph.AdjacencyMatrix.Graph<char>();
graph.AddVertex('A');
graph.AddVertex('B');
graph.AddVertex('C');
graph.AddVertex('D');
graph.AddVertex('E');
graph.AddVertex('F');
graph.AddVertex('G');
graph.AddVertex('H');
graph.AddVertex('I');
graph.AddEdge('A', 'B');
graph.AddEdge('B', 'C');
graph.AddEdge('C', 'D');
graph.AddEdge('D', 'E');
graph.AddEdge('E', 'F');
graph.AddEdge('F', 'G');
graph.AddEdge('G', 'H');
graph.AddEdge('H', 'I');
var algorithm = new BreadthFirst<char>();
Assert.IsTrue(algorithm.Find(graph, 'D'));
Assert.IsFalse(algorithm.Find(graph, 'M'));
}
}
}