Tasks
Instructions
  • Start The Algorithm by clicking on the Start A* button after selecting the Start Vertex and Vertex from any of the existing nodes
  • Cycle through the steps of the algorithm by clicking the Next button
  • Enabling Autoplay cycles though the algorithm automatically
  • Clear removes the Whole Graph
  • Clear Visited clears the status of all nodes
  • Clicking on the graph creates a node
  • Right Clicking on a node deletes it
  • You may drag a node to move it
  • Clicking on a node selects it, and clicking on a node after this, creates an edge between those 2 nodes
  • Once an edge exists, repeating the above step removes the edge between those 2 nodes
  • Green is Unvisited
  • Orange is The Frontier
  • Black is Visited
  • The current node is denoted with a bold black circular outline
  • The black outline always moves from the parent to the next neighbouring node based on the frontier
  • The end node is fixed to be node 0
  • You can only enter an edge cost larger than the absolute value of the difference of the heuristic values of the two nodes
Controls
  AutoPlay
Heuristics Table
    Information
    Path History
      Question

      Lorem ipsum dolor sit amet. Qui quae illum rem neque veritatis ab dicta minima. Ut quidem voluptatibus ab dignissimos magnam.