Tasks
Best First Search
Instructions
Start BEFS:
Begin the algorithm by clicking the
Start BEFS
button after selecting the
Start Vertex
and a
Goal Vertex
from the existing nodes.
Next:
Progress through the algorithm's steps by clicking the
Next
button.
Observation Container:
The bottom right container provides variables to enhance your understanding of the algorithm.
Autoplay:
Enable
Autoplay
to automatically cycle through the algorithm's steps.
Toggle Forces:
Click
Toggle Forces
to add dynamic, aesthetic-only movement to the nodes.
Clear:
Use the
Clear
button to remove the entire graph.
Create Graph for GBFS:
Once cleared, start from scratch to create a graph specifically for Greedy Best First Search (GBFS).
Clear Visited:
Click
Clear Visited
to reset the status of all nodes to unvisited.
Tree Depth:
Use the
Tree Depth
option to clear the graph and draw a tree based on the specified depth.
Create Node:
Click on an empty space in the graph to create a new node.
Move Node:
Drag a node to reposition it within the graph.
Create Edge:
Click on a node to select it, then click on another node to create an edge between them.
Remove Edge:
Click on a node to select it, then click on an adjacent node to remove the edge between them.
Color Coding:
Nodes are color-coded as
Green
for unvisited,
Orange
for the frontier, and
Black
for visited.
Controls
Start Vertex:
Goal Vertex:
Start BEFS
Next
AutoPlay
Toggle Forces
Clear
Clear Visited
Note: Overwrites Graph
Tree Controls:
|
Tree Depth:
Information
Goal Vector:
Frontier:
Estimated Cost(E):
Visiting:
To Visit:
Question
Answer:
Submit