| | |
- computeSpanningTree(N, weight)
- Return list of edges in a min spanning tree of N, with respect to
"weight".
- setWeights(G, weight)
- Set dict "weight" on all edges. Supported are for a=(u,v)
negative: w_a = -u_a; demand: w_a = -max( |b_u|, |b_v|)
factor: w_a = u_a / max(|b_u|, |b_v|); upper: w_a = u_a;
uniform: w_a = 1.
- treeHeuristic(N, weight)
- Return the cover computed by the tree approximation, where the min
spanning tree is w.r.t. to weight.
"weight" can be in {'upper', 'negative', 'uniform', 'demand', 'factor'}.
- treeHeuristicCombined(N)
- Return the best cover due to treeHeuristic over all weight functions.
|