| 37 | }; |
| 38 | |
| 39 | TEST_F(ConstrainedBFSVisitorTest, IdentifyUniquePath) |
| 40 | { |
| 41 | int start = 0; |
| 42 | int goal = 3; |
| 43 | int minDepth = 0; |
| 44 | int maxDepth = 2; |
| 45 | int maxBranches = 3; |
| 46 | |
| 47 | DefaultColorMap<Graph> colorMap; |
| 48 | ConstrainedBFSVisitor<Graph> visitor(start, goal, minDepth, maxDepth, maxBranches, colorMap); |
| 49 | breadthFirstSearch(start, simpleAcyclicGraph, colorMap, visitor); |
| 50 | |
| 51 | AllPathsSearchResult<V> result = visitor.uniquePathToGoal(); |
| 52 | |
| 53 | ASSERT_EQ(result.resultCode, FOUND_PATH); |
| 54 | ASSERT_EQ(result.paths.size(), 1u); |
| 55 | ASSERT_EQ(result.paths.at(0).str(), "0,2,3"); |
| 56 | } |
| 57 | |
| 58 | TEST_F(ConstrainedBFSVisitorTest, RespectMaxDepthLimit) |
| 59 | { |
nothing calls this directly
no test coverage detected