* 2. Every node should be visited.
*/
public void test_4() {
int k = 4;
Object[] obj = GraphTestUtil.buildPerfectBinaryTree(builder(), k);
final Node root = (Node)obj[0];
final Map obj2node = (Map)obj[1];
final Node ln = (Node)obj2node.get(root.getObject().toString() + ".0");
final Node rn = (Node)obj2node.get(root.getObject().toString() + ".1");
CountingWalker walker = new CountingWalker() {
private int m_mode = 0;
public int visit(Graphable element, GraphTraversal traversal) {
super.visit(element, traversal);
if (m_mode == 0) {
if (element != root) {
//check which child of root was first visited
m_mode++;
return(GraphTraversal.SUSPEND);
}
}
else if (m_mode == 1) {
String eid = element.getObject().toString();
if (ln.isVisited()) assertTrue(element == rn);
else assertTrue(element == ln);
m_mode++;
}
return(GraphTraversal.CONTINUE);
}
};
BreadthFirstIterator iterator = createIterator();
BasicGraphTraversal traversal = new BasicGraphTraversal(
builder().getGraph(), walker, iterator
);
traversal.init();
iterator.setSource(root);
traversal.traverse();
//ensure that only root and one of children is visited
assertTrue(root.isVisited());
assertTrue(
(rn.isVisited() && !ln.isVisited()) ||
(!rn.isVisited() && ln.isVisited())
);
GraphVisitor visitor = new GraphVisitor() {
public int visit(Graphable component) {
if (component != root && component != ln && component != rn) {