Commit b89c2fd

authored

Update README.md

1 parent 834093a commit b89c2fdCopy full SHA for b89c2fd

File tree

-0

lines changed

-0

lines changed

Lines changed: 2 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -25,3 +25,5 @@ Both the A* and Best First Search heuristic are based on the Manhattan distance`
`25`	`25`	`## The Application`
`26`	`26`
`27`	`27`	The application allows the user to place start, end and obstacle nodes on a grid. After placing the aforementioned nodes the user is able to select a pathfinding algorithm of his choice and start the visualization process. Once the algorithm is done, the application will display the time elapsed since the start of the algorithm and the total nodes visited in order to find the goal node. The user can now either reset the grid in order to test out another algorithm or exit completely out of the application.
	`28`	`+`
	`29`	`+![](application.png)`

Comments

(0)