public static void main(String[] args) { junit.textui.TestRunner.run(suite()); } }
int i = 0; while (s.hasNext()) { assertTrue("number of answers > " + i, i < 6); SearchNode n = s.nextAnswer(); assertEquals("costs[" + i + "] != " + n.getPriority(), costs[i], n.getPriority(), 1e-5); int j = 0; while (n != null) { assertTrue("path length > " + j, j < 3); assertTrue("path[" + i + "][" + j + "] != " + n, paths[i][j] == n.getState()); j++; n = (SearchNode)n.getParent(); assertTrue("path length != " + j, j == 3); i++; assertTrue("number of answers != " + i, i == 6);
int i = 0; while (s.hasNext()) { assertTrue("number of answers > " + i, i < 6); SearchNode n = s.nextAnswer(); assertEquals("costs[" + i + "] != " + n.getPriority(), costs[i], n.getPriority(), 1e-5); int j = 0; while (n != null) { assertTrue("path length > " + j, j < 3); assertTrue("path[" + i + "][" + j + "] != " + n, paths[i][j] == n.getState()); j++; n = (SearchNode)n.getParent(); assertTrue("path length != " + j, j == 3); i++; assertTrue("number of answers != " + i, i == 6);
public static void main(String[] args) { junit.textui.TestRunner.run(suite()); } }