public void ShouldGetNearestNodes(string igraph, int edgeWeight, int sourceNode,
string iexpectedShortestDistances)
{
//Arrange
var mockGraph = GetMockGraph(igraph, edgeWeight);
var expectedShortestDistances = ParseResult(iexpectedShortestDistances);
IShortestHops<int, int> sut = new AlgorithmNearestHopsBfs<int, int>();
//Act
var actual = sut.FindShortestHops(mockGraph, sourceNode).OrderBy(x => x.Key).Select(x=>x.Value).ToArray();
//Assert
Assert.AreEqual(expectedShortestDistances, actual);
}
public void ShouldGetNearestNodes(string igraph, int edgeWeight, int sourceNode,
string iexpectedShortestDistances)
{
//Arrange
var mockGraph = GetMockGraph(igraph, edgeWeight);
var expectedShortestDistances = ParseResult(iexpectedShortestDistances);
IShortestHops <int, int> sut = new AlgorithmNearestHopsBfs <int, int>();
//Act
var actual = sut.FindShortestHops(mockGraph, sourceNode).OrderBy(x => x.Key).Select(x => x.Value).ToArray();
//Assert
Assert.AreEqual(expectedShortestDistances, actual);
}
public void ShouldGetNearestNodesWithinSpecifiedTimelimit(int noOfNodes, int maxNoOfEdges,
int timeInMilliSeconds)
{
//Arrange
var startTime = DateTime.UtcNow;
var graph = GetGraph(noOfNodes, maxNoOfEdges);
var sourceNode = 1;
IShortestHops<int, int> sut = new AlgorithmNearestHopsBfs<int, int>();
//Act
sut.FindShortestHops(graph, sourceNode);
var endTime = DateTime.UtcNow;
//Assert
Assert.LessOrEqual(endTime.Subtract(startTime).TotalMilliseconds, timeInMilliSeconds);
}
// [TestCase(1001, 1001 * 1000 / 2, 1 * 1000)]
public void ShouldGetNearestNodesWithinSpecifiedTimelimit(int noOfNodes, int maxNoOfEdges,
int timeInMilliSeconds)
{
//Arrange
var startTime = DateTime.UtcNow;
var graph = GetGraph(noOfNodes, maxNoOfEdges);
var sourceNode = 1;
IShortestHops <int, int> sut = new AlgorithmNearestHopsBfs <int, int>();
//Act
sut.FindShortestHops(graph, sourceNode);
var endTime = DateTime.UtcNow;
//Assert
Assert.LessOrEqual(endTime.Subtract(startTime).TotalMilliseconds, timeInMilliSeconds);
}
