Traverser<Character> traverser = Traverser.forTree(CYCLIC_GRAPH_CONTAINING_TREE);

    assertEqualCharNodes(traverser.depthFirstPostOrder('a'), "cdba");
    assertEqualCharNodes(traverser.depthFirstPostOrder('b'), "cdb");
    assertEqualCharNodes(traverser.depthFirstPostOrder('d'), "d");
  }

  @Test
  public void forTree_depthFirstPostOrderIterable_cyclicGraphContainingTree() throws Exception {

errors.app.illegal.transition = Transisi tidak valid. Silakan coba lagi.
errors.app.db.already.deleted = Mungkin telah dihapus oleh proses lain. Silakan coba lagi.
errors.app.db.already.updated = Mungkin telah diperbarui oleh proses lain. Silakan coba lagi.
errors.app.db.already.exists = Data sudah ada. Silakan coba lagi.
errors.app.double.submit.request = Mungkin telah diproses sebelum permintaan ini. Silakan coba lagi.