Path planning on a 2d Grid_Map

The A_star for finding the shortest path from source to destination on binary grid_map
The BFS for finding the shortest path from source to destination on binary grid_map
The Dijkstra for finding the shortest path from source to destination on binary grid_map
The DFS to find a path (not optimal) from source to destination on a binary grid map;