This project is a visual and interactive demonstration of the Greedy Best First Search (GBFS) algorithm — an informed search algorithm that uses a heuristic to guide its pathfinding decisions. It's designed to help users understand how GBFS works through an intuitive, hands-on experience.
Greedy.Best.First.Search.Demo.mp4
Running the demonstration is simple. Just follow these steps:
-
Open the Website
Visit the live demo via the link provided in this repository.
-
Create Nodes
Begin by adding nodes to build your graph. You can name each node for easier identification.
-
Define Graph Structure
- Connect nodes to create edges between them.
- Make sure the graph is well-structured for meaningful search results.
-
Set Start and Goal Nodes On the main interface, choose a start node and a goal (target) node.
-
Run the Algorithm
Click the "Run" button to see how the Greedy Best First Search algorithm navigates through the graph. The process is visually animated to help you follow the algorithm step by step.
-
Experiment and Iterate
Not satisfied with the results? You can easily modify the graph, change the heuristic values, or adjust the nodes and connections to explore different scenarios.
| Component | Tools |
|---|---|
| Styling | Daisy UI |
| Graph visualization | D3 |
| JavaScript framework | AlpineJS |