
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Queue;

public class BFS{
    
    private int cityCount = 1;
    private int weight = 0;
    private NodeList map;
    private ArrayList<String> cities = new ArrayList<>();
    
    public BFS(NodeList m){
        
        this.map = m;
        
    }
    
    public void drive(String start){
        
        String s = start;
        Queue<Node> q = new LinkedList();
        Node root = map.search(s);
        
        //add where you start to the queue
        q.add(root);
        root.setVisit(true);
        
        while(!q.isEmpty()){
            
            //remove the first object in the queue
            Node v = q.poll();
            
            s = v.getData().getStartPoint();
            ArrayList<MapPoint> mapPoints = map.searchAll(s);
            for(//each node connected to the initial node){
                if(//the connected node has not been visited){
                    
                }
                
            }
//        if(mapPoints.isEmpty()){
//            return;
//        }
        
        }
        
    }
    
}

@@ -577,32 +577,79 @@
 (true);%0A        
+//System.out.println(root.getNext().getData());
 %0A        while(!
@@ -762,32 +762,34 @@
 );%0A            %0A
+//
             s = 
@@ -875,24 +875,26 @@
 archAll(s);%0A
+//
             
@@ -941,16 +941,18 @@
  node)%7B%0A
+//
         
@@ -1019,32 +1019,34 @@
                %0A
+//
                 
@@ -1068,109 +1068,32 @@
    %0A
-            %7D%0A//        if(mapPoints.isEmpty())%7B%0A//            return;%0A//        %7D%0A        %0A        %7D
+//            %7D%0A      %7D%0A
 %0A   

Update BFS.java