Chapter 15, Problem 14PP

Program Plan Intro

Distance Finder

Program plan:

DistanceFinder.java

• Create a class named “DistanceFinder”. Inside the class,
  • Define the required variables.
  • Define the map.
  • Define the “DistanceFinder ()” method.
    • Create the hash map
    • Inside the try block
      • Use the loop to iterate between the values.
      • Use necessary conditions to from and to direction and assign the required values.
    • Inside the catch block
      • Display the error message.
  • Define the “getStartingCity ()” method.
    • Return the city we start.
  • Define the “shortestDistances ()” method.
    • Define the required queue.
    • Add the distance.
    • Loop that iterates for the values of the queues.
    • Use condition to compare the values and return shortest distance.

DistanceFinderDemo.java

• Create a class named “DistanceFinderDemo”. Inside the class,
  • Define the method “main ()”
    • Define the object.
    • Define the scanner object.
    • Get the file name.
    • Validate the file.
    • Display the required information.

DistanceTo.java:

• Create a class named “DistanceTo”. Inside the class,
  • Define the required variables.
  • Define the method “DistanceTo ()”
    • Initialize the variables.
  • Define the “getTarget ()” method.
    • Return the target.
  • Define the “getDistance ()” method.
    • Return the distance.
  • Define the “compareTo ()” method.
    • Return the distance.
  • Define the “toString ()” method.
    • Return the target distance.