public void GetEdges_CorrectlyReports_Weight()
{
var graph = new StringNeighborhoodGraph(new[] { "a", "b" });
// ReSharper disable once CompareOfFloatsByEqualityOperator
Assert.IsTrue(graph.GetEdges("a").All(e => e.Weight == 1));
}
public void FindShortestPath_WillTraverseTheGraphInExpectedOrder()
{
var graph = new StringNeighborhoodGraph(new[] { "aa", "za", "zz", "zb", "ib", "i7", "17", "a6", "16" });
TestHelper.AssertSequence(graph.FindShortestPath("aa", "17"),
"aa", "a6", "16", "17");
}
public void GetEdges_ProperlyJoinsSingleLetterStrings([NotNull] string vertex, string expected)
{
var graph = new StringNeighborhoodGraph(new[] { "a", "b", "c" });
var actual = string.Join(",", graph.GetEdges(vertex).Select(s => s.ToVertex));
Assert.AreEqual(expected, actual);
}
public void GetEdges_ThrowsException_ForInvalidVertex()
{
var graph = new StringNeighborhoodGraph(new[] { "a", "b", "c" });
Assert.Throws <ArgumentException>(() => graph.GetEdges("z"));
}
public void GetEdges_CorrectlyReports_FromVertex()
{
var graph = new StringNeighborhoodGraph(new[] { "a", "b" });
Assert.IsTrue(graph.GetEdges("a").All(e => e.FromVertex == "a"));
}
public void Enumeration_ReturnsSingleVertex()
{
var graph = new StringNeighborhoodGraph(new[] { "test" });
TestHelper.AssertSequence(graph, "test");
}
public void Enumeration_ReturnsNothing_ForEmptyGraph()
{
var graph = new StringNeighborhoodGraph(new string[] { });
TestHelper.AssertSequence(graph);
}
public void Enumeration_ReturnsAllVertices()
{
var graph = new StringNeighborhoodGraph(new[] { "a", "b", "c" });
TestHelper.AssertSequence(graph, "a", "b", "c");
}
public void SupportsPotentialWeightEvaluation_ReturnsFalse()
{
var graph = new StringNeighborhoodGraph(new[] { "a", "b", "c" });
Assert.IsFalse(graph.SupportsPotentialWeightEvaluation);
}
