Instructions

Start GBFS: Initiate the algorithm by clicking the Start BEFS button after selecting both the Start Vertex and a Goal Vertex from the existing nodes.
Next: Advance through the algorithm's steps by clicking the Next button.
Observation Container: Located at the bottom right, this provides variables to enhance your understanding of the algorithm.
Question Container: Poses a question that, when answered correctly, allows the algorithm to proceed.
Autoplay: Activate Autoplay to cycle through the algorithm steps automatically.
Toggle Forces: Click Toggle Forces to add dynamic movement to the nodes, which is only for visual effect.
Clear: Remove the entire graph by clicking the Clear button.
Create Graph for GBFS: Once cleared, start from scratch to create a graph specifically for Greedy Best First Search (GBFS).
Clear Visited: Reset all nodes to their unvisited state by clicking Clear Visited.
Tree Depth: Erase the current graph and draw a new tree based on the entered depth input by using the Tree Depth function.
Create Node: Add a new node by clicking on an empty space within the graph.
Move Node: Change a node's position by dragging it.
Create Edge: Form an edge between two nodes by clicking on one and then the other.
Remove Edge: Delete an edge by clicking on two adjacent nodes in sequence.
Color Coding: Nodes are color-coded as Green for unvisited, Orange for the frontier, and Black for visited.

Controls

Start Vertex:
Goal Vertex:

AutoPlay

Note: Overwrites Graph

Tree Controls:

| Tree Depth:

Information

Goal Vector:

Frontier:

Estimated Cost(E):

Visiting:

To Visit:

Question

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

Answer: