public void LongestDistanceTwoVerticesGraph()
{
var sut = new LongestPathInADirectedAcyclicGraph();
var graph = new[]
{
new WeightedGraphVertex
{
Edges = new System.Collections.Generic.List <WeightedGraphNodeEdge>
{
new WeightedGraphNodeEdge
{
From = 0,
To = 1,
Weight = 10,
}
}
},
new WeightedGraphVertex()
};
#pragma warning disable HAA0101 // Array allocation for params parameter
Assert.Collection(sut.GetLongestPath(graph), arg => Assert.Equal(0, arg), arg => Assert.Equal(10, arg));
#pragma warning restore HAA0101 // Array allocation for params parameter
}
public void LongestDistanceInOneVerticeGraphIsZero()
{
var sut = new LongestPathInADirectedAcyclicGraph();
var graph = new[]
{
new WeightedGraphVertex(),
};
Assert.Collection(sut.GetLongestPath(graph), arg => Assert.Equal(0, arg));
}
public void Baseline()
{
var sut = new LongestPathInADirectedAcyclicGraph();
var graph = new[]
{
new WeightedGraphVertex
{
Edges = new System.Collections.Generic.List <WeightedGraphNodeEdge>
{
new WeightedGraphNodeEdge
{
From = 0,
To = 1,
Weight = 5,
},
new WeightedGraphNodeEdge
{
From = 0,
To = 2,
Weight = 3,
}
}
},
new WeightedGraphVertex
{
Edges = new System.Collections.Generic.List <WeightedGraphNodeEdge>
{
new WeightedGraphNodeEdge
{
From = 1,
To = 3,
Weight = 6,
},
new WeightedGraphNodeEdge
{
From = 1,
To = 2,
Weight = 2,
}
}
},
new WeightedGraphVertex
{
Edges = new System.Collections.Generic.List <WeightedGraphNodeEdge>
{
new WeightedGraphNodeEdge
{
From = 2,
To = 4,
Weight = 4,
},
new WeightedGraphNodeEdge
{
From = 2,
To = 5,
Weight = 2,
},
new WeightedGraphNodeEdge
{
From = 2,
To = 3,
Weight = 7,
}
}
},
new WeightedGraphVertex
{
Edges = new System.Collections.Generic.List <WeightedGraphNodeEdge>
{
new WeightedGraphNodeEdge
{
From = 3,
To = 5,
Weight = 1,
},
new WeightedGraphNodeEdge
{
From = 3,
To = 4,
Weight = -1,
}
}
},
new WeightedGraphVertex
{
Edges = new System.Collections.Generic.List <WeightedGraphNodeEdge>
{
new WeightedGraphNodeEdge
{
From = 4,
To = 5,
Weight = 2,
}
}
},
new WeightedGraphVertex
{
},
};
var collection = sut.GetLongestPath(graph);
#pragma warning disable HAA0101 // Array allocation for params parameter
Assert.Collection(collection,
arg => Assert.Equal(0, arg),
arg => Assert.Equal(5, arg),
arg => Assert.Equal(7, arg),
arg => Assert.Equal(14, arg),
arg => Assert.Equal(13, arg),
arg => Assert.Equal(15, arg));
#pragma warning restore HAA0101 // Array allocation for params parameter
}
