find the path from start to goal using breadth first search concode_field_sep PlaceHolder placeHolder concode_field_sep int getNumEdges concode_elem_sep Set<GeographicPoint> getVertices concode_elem_sep List<GeographicPoint> dijkstra concode_elem_sep List<GeographicPoint> dijkstra concode_elem_sep List<GeographicPoint> aStarSearch concode_elem_sep List<GeographicPoint> aStarSearch concode_elem_sep void main concode_elem_sep int getNumVertices concode_elem_sep boolean addVertex concode_elem_sep void addEdge
List < GeographicPoint > function ( GeographicPoint arg0 , GeographicPoint arg1 ) { Consumer < GeographicPoint > loc0 = ( x ) -> { } ; return bfs ( arg0 , arg1 , loc0 ) ; }