public void ShortestPathToBlockedEdge() { Graph graph = new Graph(1); Node a = new Node("a"); Node b = new Node("b"); Node c = new Node("c"); Node d = new Node("d"); Node e = new Node("e"); graph.AddNode(a); graph.AddNode(b); graph.AddNode(c); graph.AddNode(d); graph.AddNode(e); graph.AddUndirectedEdge(new Tuple<Node, int>(a, 1), new Tuple<Node, int>(b, 3), 1); graph.AddUndirectedEdge(new Tuple<Node, int>(b, 2), new Tuple<Node, int>(c, 0), 2); graph.AddUndirectedEdge(new Tuple<Node, int>(c, 3), new Tuple<Node, int>(d, 1), 3); //block this graph.AddUndirectedEdge(new Tuple<Node, int>(d, 0), new Tuple<Node, int>(e, 2), 200); graph.AddUndirectedEdge(new Tuple<Node, int>(e, 1), new Tuple<Node, int>(a, 3), 100); graph.BlockEdge(c, d); Path expectedPath = new Path() { Identifier = 1, Nodes = new List<Node>(){a, b, c} }; Path actualPath = graph.PathToBlockedEdge(a, graph.BlockedEdges.FirstOrDefault()); actualPath.Identifier = 1; Assert.IsTrue(expectedPath.Equals(actualPath)); }