graphenv.examples.tsp.graph_utils.calc_greedy_dist

calc_greedy_dist(G)[source]

Calculate the distance for a greedy search tour over the given graph. :param G: The Graph should be a complete weighted undirected graph.

Returns

a positive distance for the resulting search

Return type

dist

Parameters

G (networkx.classes.graph.Graph) –