-
Notifications
You must be signed in to change notification settings - Fork 1
/
BridgesInGraphTests.cs
61 lines (51 loc) · 1.72 KB
/
BridgesInGraphTests.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
using AlgorithmsAndDataStructures.Algorithms.Graph.Common;
using AlgorithmsAndDataStructures.Algorithms.Graph.Misc;
using System;
using Xunit;
namespace AlgorithmsAndDataStructures.Tests.Algorithm.Graph
{
public class BridgesInGraphTests
{
[Fact]
public void EmptyGraphHasNoBridges()
{
var sut = new BridgesInGraph();
var graph = new UndirectedGraph(0);
Assert.Empty(sut.GetBridges(graph));
}
[Fact]
public void OneVerticeGraphHasNoBridges()
{
var sut = new BridgesInGraph();
var graph = new UndirectedGraph(1);
Assert.Empty(sut.GetBridges(graph));
}
[Fact]
public void TwoVerticeGraphHasOneBridges()
{
var sut = new BridgesInGraph();
var graph = new UndirectedGraph(2);
graph.Connect(0,1);
Assert.Collection(sut.GetBridges(graph), arg => Assert.Equal(new Tuple<int, int>(0,1), arg));
}
[Fact]
public void ThreeVerticeGraphHasNoBridges()
{
var sut = new BridgesInGraph();
var graph = new UndirectedGraph(3);
graph.Connect(0, 1);
graph.Connect(1, 2);
graph.Connect(2, 0);
Assert.Empty(sut.GetBridges(graph));
}
[Fact]
public void ThreeVerticeGraphHasTwoBridges()
{
var sut = new BridgesInGraph();
var graph = new UndirectedGraph(3);
graph.Connect(0, 1);
graph.Connect(0, 2);
Assert.Collection(sut.GetBridges(graph), arg => Assert.Equal(new Tuple<int, int>(0, 1), arg), arg => Assert.Equal(new Tuple<int, int>(0, 2), arg));
}
}
}