def main(): allCities = importData("santa_cities.csv") #allCities = importData("santa_cities_test.csv") dist = Dist(allCities) print "done with dist matrix" bestPath = furthestInsertion(allCities, dist) print evaluate(bestPath, dist) exportPaths(bestPath, "run1.csv") print noSharedEdge(bestPath)
def main(): #allCities = importData("santa_cities.csv") allCities = importData("santa_cities_test.csv") allEdges = minEdgeAlg(allCities) for x in allEdges[0:100]: print x.dist() assignEdge(allEdges) path1, path2 = getPaths(allEdges) visualize(allEdges, allCities, 1)