#include <common/arith.h>
#include <topfish/hierarchy.h>
-static int cur_level = 0;
-
/////////////////////////
// Some utilities for //
// 'maxmatch(..)' //
ex_vtx_data *cgraph;
int *cv2v;
int v, u;
- int min_level = cur_level;
+ int min_level = 0;
graph = hierarchy->geom_graphs[min_level]; // finest graph
n = hierarchy->nvtxs[min_level];
{
min_dist = findClosestActiveNode(hierarchy, i, top_level, x, y,min_dist, &closest_node, &closest_node_level);
}
- *closest_fine_node =find_leftmost_descendant(hierarchy, closest_node,closest_node_level, cur_level);
+ *closest_fine_node =find_leftmost_descendant(hierarchy, closest_node,closest_node_level, 0);
return min_dist;
}