-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathTarjansAlgorithmForBiconnectedComponentsTests.cs
More file actions
63 lines (57 loc) · 2.58 KB
/
TarjansAlgorithmForBiconnectedComponentsTests.cs
File metadata and controls
63 lines (57 loc) · 2.58 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
using AlgorithmsAndDataStructures.Algorithms.Graph.Common;
using AlgorithmsAndDataStructures.Algorithms.Graph.Misc;
using Xunit;
namespace AlgorithmsAndDataStructures.Tests.Algorithm.Graph;
public class TarjansAlgorithmForBiconnectedComponentsTests
{
[Fact]
public void EmptyGraphHashNoBiconnectedComponents()
{
var sut = new TarjansAlgorithmForBiconnectedComponents();
var biconnectedComponents = sut.GetBiconnectedComponents(new UndirectedGraph(0));
Assert.Empty(biconnectedComponents);
}
[Fact]
public void OneVerticeGraphHashOneBiconnectedComponent()
{
var sut = new TarjansAlgorithmForBiconnectedComponents();
var biconnectedComponents = sut.GetBiconnectedComponents(new UndirectedGraph(1));
Assert.Collection(biconnectedComponents, arg => { Assert.Collection(arg, arg => Assert.Equal(0, arg)); });
}
[Fact]
public void TwoVerticeGraphHashHashOneBiconnectedComponent()
{
var sut = new TarjansAlgorithmForBiconnectedComponents();
var graph = new UndirectedGraph(2);
graph.Connect(0, 1);
var biconnectedComponents = sut.GetBiconnectedComponents(graph);
Assert.Collection(biconnectedComponents,
arg => { Assert.Collection(arg, arg => Assert.Equal(1, arg), arg => Assert.Equal(0, arg)); });
}
[Fact]
public void ThreeVerticeGraphHashHashTwoBiconnectedComponent()
{
var sut = new TarjansAlgorithmForBiconnectedComponents();
var graph = new UndirectedGraph(3);
graph.Connect(0, 1);
graph.Connect(1, 2);
var biconnectedComponents = sut.GetBiconnectedComponents(graph);
Assert.Collection(biconnectedComponents,
arg => { Assert.Collection(arg, arg => Assert.Equal(1, arg), arg => Assert.Equal(2, arg)); },
arg => { Assert.Collection(arg, arg => Assert.Equal(1, arg), arg => Assert.Equal(0, arg)); });
}
[Fact]
public void LinedUpGraph()
{
var sut = new TarjansAlgorithmForBiconnectedComponents();
var graph = new UndirectedGraph(4);
graph.Connect(0, 1);
graph.Connect(1, 2);
graph.Connect(2, 3);
var biconnectedComponents = sut.GetBiconnectedComponents(graph);
Assert.Collection(biconnectedComponents,
arg => { Assert.Collection(arg, arg => Assert.Equal(2, arg), arg => Assert.Equal(3, arg)); },
arg => { Assert.Collection(arg, arg => Assert.Equal(1, arg), arg => Assert.Equal(2, arg)); },
arg => { Assert.Collection(arg, arg => Assert.Equal(1, arg), arg => Assert.Equal(0, arg)); });
}
}