Created
February 1, 2010 03:22
-
-
Save mlbright/291432 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/python | |
# --------------------------------------------------------------------------------- # | |
import sys, os | |
from graph import load, pathCost, findHamiltonianCycles as fhc | |
# --------------------------------------------------------------------------------- # | |
def machineList(path,names): | |
machines = [] | |
for i in range(len(path)-1): | |
machines.append(names[(path[i],path[i+1])]) | |
machines.sort() | |
machines = [ str(m) for m in machines ] | |
return ' '.join(machines) | |
# --------------------------------------------------------------------------------- # | |
try: | |
filename = sys.argv[1] | |
except IndexError: | |
sys.stderr.write('no input specified\n') | |
sys.exit(1) | |
prices = {} | |
names = {} | |
for line in file(filename).readlines(): | |
(name, src, dst, price) = line.rstrip().split() | |
name = int(name.replace('M','')) | |
src = int(src.replace('C','')) | |
dst = int(dst.replace('C','')) | |
price = int(price) | |
t = (src,dst) | |
if t in prices and prices[t] <= price: | |
continue | |
prices[t] = price | |
names[t] = name | |
G = load(prices,prices) | |
a = fhc(G) | |
cheapest = sys.maxint | |
cheapestPath = None | |
for p in a: | |
c = pathCost(p,prices) | |
if c < cheapest: | |
cheapest = c | |
cheapestPath = p | |
print cheapest | |
print machineList(cheapestPath,names) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment