find the path from start to goal using dijkstra 's algorithm concode_field_sep HashMap<GeographicPoint,Vertex> nodes concode_field_sep boolean bfsSearch concode_elem_sep void printVertices concode_elem_sep void printNeighbors 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 List<GeographicPoint> bfs concode_elem_sep List<GeographicPoint> bfs concode_elem_sep LinkedList<GeographicPoint> creatingPath concode_elem_sep int getNumEdges concode_elem_sep void printEdges concode_elem_sep Set<GeographicPoint> getVertices concode_elem_sep boolean dijkstraAlgorithm concode_elem_sep boolean addVertex concode_elem_sep void addEdge concode_elem_sep boolean aStarAlgorithm
List < GeographicPoint > function ( GeographicPoint arg0 , GeographicPoint arg1 ) { Consumer < GeographicPoint > loc0 = ( x ) -> { } ; return dijkstra ( arg0 , arg1 , loc0 ) ; }