Java computer science question

Posted on 2014-03-29 12:33:00 in Computer-Science by TRIDENT LAYERS

I'm doing a program that finds the shortest distance between two cities given different routes (through other cities: connections). I have a hashmap called shortestknowndistance. All I want to do is set d to the distance to the target city. What do I do?





Map<String, TreeSet<DistanceTo>> shortestKnownDistance = new HashMap<String, TreeSet<DistanceTo>>();



Scanner in = new Scanner(System.in);

System.out.println("What is the starting city?");

String from = in.next();

System.out.println("What is the finishing city?");

String target = in.next();

DistanceTo startingPoint = new DistanceTo(from, 0);

PriorityQueue<DistanceTo> myQueue = new PriorityQueue<DistanceTo>();

myQueue.add(startingPoint);

while (myQueue.size() != 0) {

myQueue.remove();

while (!shortestKnownDistance.containsKey(targ... {

//TreeSet<DistanceTo> d = ??????????

shortestKnownDistance.put(target, d);

---

Answer Comment

No Answers Posted Yet.