-
Notifications
You must be signed in to change notification settings - Fork 31
Expand file tree
/
Copy pathEdgeTest.cs
More file actions
152 lines (115 loc) · 4.07 KB
/
EdgeTest.cs
File metadata and controls
152 lines (115 loc) · 4.07 KB
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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
using Dijkstra.NET.Graph;
using Dijkstra.NET.ShortestPath;
using System.Linq;
using Xunit;
namespace Dijkstra.NET.Tests
{
public class EdgeTest
{
[Fact]
public void Two_Edges_Should_Be_Equal()
{
var g = new Graph<string, int>() + "node1";
var n = g >> 1;
var a = new Edge<string, int>(n, 1, 1);
var b = new Edge<string, int>(n,1, 1);
bool act = a.Equals(b);
Assert.True(act);
}
[Fact]
public void Two_Edges_Should_Be_Equal_With_Null_References()
{
var g = new Graph<string, string>() + "node1";
var n = g >> 1;
var a = new Edge<string, string>(n, 1, null);
var b = new Edge<string, string>(n,1, null);
bool act = a.Equals(b);
Assert.True(act);
}
[Fact]
public void Two_Edges_Should_Be_Diffrent_With_Null_Reference()
{
var g = new Graph<string, string>() + "node1";
var n = g >> 1;
var a = new Edge<string, string>(n, 1, null);
var b = new Edge<string, string>(n,1, "a");
bool act = a.Equals(b);
bool act2 = b.Equals(a);
Assert.False(act);
Assert.False(act2);
}
[Fact]
public void Two_Edges_Should_Be_Diffrent_With_Diffrent_Parameter()
{
var g = new Graph<string, string>() + "node1";
var n = g >> 1;
var a = new Edge<string, string>(n, 1, "b");
var b = new Edge<string, string>(n,1, "a");
bool act = a.Equals(b);
bool act2 = b.Equals(a);
Assert.False(act);
Assert.False(act2);
}
[Fact]
public void Two_Edges_Should_Be_Diffrent_With_Diffrent_Costs()
{
var g = new Graph<string, string>() + "node1";
var n = g >> 1;
var a = new Edge<string, string>(n, 3, "a");
var b = new Edge<string, string>(n,1, "a");
bool act = a.Equals(b);
bool act2 = b.Equals(a);
Assert.False(act);
Assert.False(act2);
}
[Fact]
public void Two_Edges_Should_Be_Diffrent_With_Diffrent_Nodes()
{
var g = new Graph<string, string>() + "node1" + "node2";
var n1 = g >> 1;
var n2 = g >> 2;
var a = new Edge<string, string>(n1, 1, "a");
var b = new Edge<string, string>(n2,1, "a");
bool act = a.Equals(b);
bool act2 = b.Equals(a);
Assert.False(act);
Assert.False(act2);
}
[Fact]
public void Edges_Get_TEdgeCustom_Should_Work()
{
var g = new Graph<int, string>();
g.AddNode(1);
g.AddNode(2);
g.AddNode(3);
g.Connect(1, 2, 1, "First");
g.Connect(1, 3, 1, "Second");
var node = g >> 1;
var first = node.GetFirstEdgeCustom(2);
var second = node.GetFirstEdgeCustom(3);
bool act = first == "First" && second == "Second";
Assert.True(act);
}
[Fact]
public void Edges_Get_Full_Path_Custom()
{
var g = new Graph<int, string>();
g.AddNode(1);
g.AddNode(2);
g.AddNode(3);
g.Connect(1, 2, 1, "First");
g.Connect(2, 3, 1, "Second");
var path = g.Dijkstra(1, 3);
var pathCustom = path.GetPathEdgesCustom(g);
var pathCustomReversed = path.GetReversedPathEdgesCustom(g);
bool act = pathCustom.Count() == 2;
bool act2 = pathCustomReversed.Count() == 2;
bool act3 = pathCustom.First() == "First";
bool act4 = pathCustomReversed.First() == "Second";
Assert.True(act);
Assert.True(act2);
Assert.True(act3);
Assert.True(act3);
}
}
}