Searched refs:tree_cost (Results 1 – 12 of 12) sorted by relevance
104 tmp.tree_cost = totalcost; in undirectedGraph()127 tmp.tree_cost = totalcost; // tree_cost in undirectedGraph()
31 int tree_cost, upper_bound; in mst() local107 tree_cost = make_k_tree(p, tree, lamda, k); in mst()151 cur_bound += tree_cost; in mst()
42 double tree_cost; member
45 OUT tree_cost FLOAT) -- Spanning tree cost
46 OUT tree_cost FLOAT) -- Spanning tree cost
118 double bound, tree_cost; in decomp_lower_bound() local130 tree_cost = decomp_make_k_tree(vrp, edge_costs, tree, numroutes); in decomp_lower_bound()148 bound += tree_cost; in decomp_lower_bound()
109 static int tree_cost (tree t) in tree_cost() function247 unsigned int cost = tree_cost (t); in candidate()272 || best_cost[fn] + 6 < tree_cost (t)) in try_tree()
113 static int tree_cost (tree t) in tree_cost() function251 unsigned int cost = tree_cost (t); in candidate()276 || best_cost[fn] + 6 < tree_cost (t)) in try_tree()
170 values[4] = Float8GetDatum(result_tuples[funcctx->call_cntr].tree_cost); in randomSpanningTree()
255 my $tree_cost = 2 * $nodes_below - 1; # $edges_below == $nodes_below - 1
3722 float tree_cost = 0; in calc_tree_cost() local3728 tree_cost = alpha2 * M * (float) det_cost + (1 - alpha2) * (float) wl; in calc_tree_cost()3729 return (tree_cost); in calc_tree_cost()