Graphical demo of the A-Star shortest path finding algorithm coded with JavaScript, html, and css.

• Left-click to select the start/target node
• Press 'r' proceed after shortest path display
• Press 't' to toggle between displaying the shortest path and the full set of of nodes scanned in the algorithm
• Press 'd' to toggle usage of diagnol moves
• Press 'n' to nullify highlighted node
• If no path is possible, node closest to target will blink during shortest path display
• Sliders to adjust the number of rows, number of columns, and the probability of nullified nodes in the graph