find the path from start to goal using a-star search concode_field_sep int numVertices concode_elem_sep HashMap<GeographicPoint,MapNode1> vertices concode_elem_sep int numEdges concode_field_sep List<GeographicPoint> constructPath concode_elem_sep int getNumEdges concode_elem_sep Set<GeographicPoint> getVertices concode_elem_sep List<GeographicPoint> dijkstra concode_elem_sep List<GeographicPoint> dijkstra concode_elem_sep void main concode_elem_sep int getNumVertices concode_elem_sep boolean addVertex concode_elem_sep void addEdge concode_elem_sep List<GeographicPoint> bfs concode_elem_sep List<GeographicPoint> bfs
List < GeographicPoint > function ( GeographicPoint arg0 , GeographicPoint arg1 , Consumer < GeographicPoint > arg2 ) { return null ; }