def min_rand(graph):
min_length = 1000000000
min_path = []
for i in xrange(graph.size * 100):
l = greedy.tsp(graph, select_function = greedy.random)
if (l[0] < min_length):
min_length = l[0]
min_path = l[1]
return (min_length, min_path)
def greedy_shortest(graph):
return greedy.tsp(graph, func_name="shortest")
