@@ -0,0 +1,889 @@
+%0Aimport java.util.ArrayList;%0A%0Apublic class MST %7B%0A    %0A    ArrayList%3CMapPoint%3E roads = new ArrayList%3C%3E();%0A    NodeList map;%0A    String start;%0A    %0A    public MST(NodeList map, String sp)%7B        %0A        this.map = map;%0A        this.start = sp;%0A    %7D%0A    %0A    //make this recursive?%0A    public void driveTo(String sp)%7B%0A        //Search for the smallest distance MapPoint based on given starting point.%0A        ArrayList%3CMapPoint%3E mp = map.searchAll(sp);%0A        MapPoint d = mp.get(0);%0A        for(int i = 1; i %3C mp.size(); i++)%7B%0A            if((mp.get(i).getDistance() %3C d.getDistance())  ) //add notVisited logic check%0A                d = mp.get(i);%0A        %7D%0A         %0A        this.roads.add(d);%0A        System.out.println(d.getEndPoint());%0A        //return driveTo(d.getEndPoint());%0A        %0A    %7D%0A    %0A    public static void main(String%5B%5D args)%7B%0A        %0A        %0A        %0A    %7D%0A   %0A%7D%0A

Create MST.java