hints.max_memory_per_partition = Long.MAX_VALUE;
this.partitioner.setParameters(agraph, table_visit_order, proc_visit_order);
this.partitioner.init(this.hints);
StateVertex start_vertex = StateVertex.getStartVertex(Double.MAX_VALUE, Long.MAX_VALUE);
TraverseThread thread = this.partitioner.new TraverseThread(info, hints, start_vertex, agraph, table_visit_order, proc_visit_order);
assertNotNull(thread);
thread.traverse(start_vertex, 0);
// Make sure that the solution we pick has a memory and a cost
StateVertex best_vertex = this.partitioner.getBestVertex();
assertNotNull(best_vertex);
Map<CatalogType, CatalogType> m = best_vertex.getCatalogMap(catalog_db);