Update README.md

Author: ss892714028

README.md

@@ -1,5 +1,5 @@
-## Maze PathFinder Visualizer implemented in Python
-### How to use
+# Maze PathFinder Visualizer implemented in Python
+## How to use
 Go to config.py and change settings.
 'bfs' for Breadth first search
 'dfs' for Depth first search
@@ -12,28 +12,28 @@ python ./src/drawer.py
 * Click or click and drag to create obstacles
 * Press space bar and see the algorithm takes off!
 ### Symbols
-#### "@": Start and end node
-#### "#": Obstacles
-#### "*": Visited node
-#### "+": Path
+* "@": Start and end node
+* "#": Obstacles
+* "*": Visited node
+* "+": Path
 
-### Contributions
+## Contributions
 All contributions are welcome. :)
 
-### Algorithm Implemented
+## Algorithm Implemented
 * BFS (unweighted Dijastra)
 * DFS
 * ASTAR (A*)
 
-#### Breadth First Search (unweighted Dijkstra)
+### Breadth First Search (unweighted Dijkstra)
 Breadth First Search is unweighted and guarantee a optimal path.
 ![BFS](https://github.com/ss892714028/Maze-PathFinder-Visualization-Python/blob/master/gifs/bfs.gif)
 
-#### Depth First Search
+### Depth First Search
 Depth First Search is unweighted and does not guarantee a optimal path.
 ![DFS](https://github.com/ss892714028/Maze-PathFinder-Visualization-Python/blob/master/gifs/dfs-nonoptimal.gif)
 
-#### Astar (A*)
+### Astar (A*)
 A* is weighted and guarantee a optimal path.                                                         
 ![A* easy](https://github.com/ss892714028/Maze-PathFinder-Visualization-Python/blob/master/gifs/a-star_ez.gif)
 ![A*](https://github.com/ss892714028/Maze-PathFinder-Visualization-Python/blob/master/gifs/a-star.gif)