Xiaoshen Ma
William Chen
Tami Takada
Viana Lin
Yaying Liang Li
Scanner to find the number of cities;
Parsing: if city isn't in array, add it; then length array gives you number of cities;
Start(3): paths = [0] [1] [2] ArrayList<ArrayList> paths for(int i = 0; i < cities.size(); i++) ArrayList apath apath.add(i) paths.add(apath)
while(path.get(0)).size() < cities.size() Iterating 1 paths = [0, 1] [0, 2] [1, 0] [1, 2] ... for(ArrayLists in ArrayList paths) for(int i = 0; i < cities.size(); i++) if(ArrayList doesn't contain i) add i
Iterating 2 paths = [0, 1, 2] [0, 2, 1] [1, 0, 2] [1, 2, 0] ...
Go through each path and add costs for(i : paths) for add if total < min, min = total