| 50 | }; |
| 51 | |
| 52 | TEST_F(ConstrainedBidiBFSVisitorTest, IdentifyUniquePath) |
| 53 | { |
| 54 | ConstrainedBidiBFSVisitor<Graph> |
| 55 | visitor(simpleAcyclicGraph, 0, 3, 1, 1, 3, 2, NO_LIMIT, NO_MEM_LIMIT); |
| 56 | bidirectionalBFS(simpleAcyclicGraph, 0, 3, visitor); |
| 57 | |
| 58 | Path<V> uniquePath; |
| 59 | PathSearchResult result = visitor.uniquePathToGoal(uniquePath); |
| 60 | |
| 61 | ASSERT_EQ(FOUND_PATH, result); |
| 62 | ASSERT_EQ("0,2,3", uniquePath.str()); |
| 63 | } |
| 64 | |
| 65 | TEST_F(ConstrainedBidiBFSVisitorTest, StartEqualsGoal) |
| 66 | { |
nothing calls this directly
no test coverage detected