1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
import java.util.*;
import java.io.*;
 
/** Contains a main method to find the closest Google server from
 * a file of ping data.
 */
class FindGoogle {
 
  /** Returns true if the given server name ends in 1e100.net. */
  public static boolean isGoogle(String host) {
    return host.endsWith(".1e100.net");
  }
 
  // The stored graph that you want to search
  private PingGraph G;
 
  /** Constructs a new PingGraph from the given file and saves it for
   * later searching.
   */
  public FindGoogle(String pingsFile) {
    // NOTE: This is already written for you. Should require no changes.
 
    Scanner pingsIn = null;
    try { pingsIn = new Scanner(new File(pingsFile)); }
    catch (FileNotFoundException ee) {
      System.err.println("File " + pingsFile + " not found; aborting.");
      System.exit(2);
    }
 
    this.G = new PingGraph();
    while (pingsIn.hasNext()) {
      this.G.addEdge(new PingEdge(
          pingsIn.next(), 
          pingsIn.next(), 
          pingsIn.nextFloat()
      ));
    }
    pingsIn.close();
  }
 
  /** Performs a search in the pings graph from the given source.
   * The name of the closest Google destination, as well as the
   * time to that destination, are printed.
   */
  public void search(String source) {
    ////////////////////////////////////////////////////////////////////
    // TODO You have to write Dijkstra's algortihm here!!             //
    // Tips:                                                          // 
    // * You will need a minimum-priority queue. You can use          //
    //   java.util.PriorityQueue, or modify the TimeHeap from HW 10   //
    //   to make it a minimum-heap.                                   //
    // * You will need to remember which vertices have been visited.  //
    //   That may involve another data structure, such as a map from  //
    //   strings to booleans.                                         //
    // * Whenever you "visit" a vertex, call the isGoogle helper      //
    //   method to tell whether it ends in 1e100.net. If so, stop the //
    //   search immediately and print out the result.                 //
    // * If the search ends without finding any google server, you    //
    //   have to print out "unreachable".                             //
    ////////////////////////////////////////////////////////////////////
 
    System.out.println("unreachable");
  }
 
  /** This program will read in pings data from a file,
   * then prompt for searches to perform.
   */
  public static void main(String[] args) {
    // NOTE: This is already written for you. Should require no changes.
 
    if (args.length != 1) {
      System.err.println("Need 1 command-line argument for the pings file.");
      System.exit(1);
    }
 
    // Read in the graph and save it
    FindGoogle finder = new FindGoogle(args[0]);
 
    // Prompt for searches to perform
    Scanner searchRequests = new Scanner(System.in);
    System.err.print("Enter starting hostname, or CTRL-D to quit: ");
    while (searchRequests.hasNext()) {
      String source = searchRequests.next();
      finder.search(source);
      System.err.print("Enter starting hostname, or CTRL-D to quit: ");
    }
  }
}