public void TestAddingEdge()
{
var reason = "graph should contain edge a->b";
var a_b = new E("a", "b");
testGraph.AddVertex("a");
testGraph.AddVertex("b");
testGraph.AddDirectedEdge(a_b);
Assert.IsTrue(testGraph.ContainsEdge(a_b), reason);
}
public void Setup()
{
testGraph = new AdjacencyListGraph <string, Edge <string> >();
foreach (var vertex in vertices)
{
testGraph.AddVertex(vertex);
}
foreach (var edge in edges)
{
testGraph.AddDirectedEdge(edge);
}
}
public void Setup()
{
testGraph = new AdjacencyListGraph <string, E>();
foreach (string vertex in vertices)
{
testGraph.AddVertex(vertex);
}
foreach (E edge in edgesCosts.Keys)
{
testGraph.AddDirectedEdge(edge);
}
shortestPath = new Algorithms.DijkstraShortestPath <string, E>(testGraph, edgesCosts);
shortestPath.ComputeAllFromVertex("a");
}
