Skip to content

🌊 A tool that can help visualize four different graph traversal algorithms (Dijkstra's , BFS, DFS, and A*) through simulating a boat β›΅ in the ocean attempting to avoid icebergs πŸ”οΈ while trying to find the best path to the treasure πŸ†.

Notifications You must be signed in to change notification settings

KidusLegesse/AlgorithmVisualizer

Folders and files

NameName
Last commit message
Last commit date

Latest commit

Β 

History

8 Commits
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 

Repository files navigation

Algorithm Visualizer Website β›΅ βš“

🚀Link to the website.

πŸ—ΊοΈWebsite description: A tool that can help visualize four different graph traversal algorithms (Dijkstra's , Breadth-First Search (BFS), Depth-First Search (DFS), and A*) through simulating a boat β›΅ in the ocean attempting to avoid icebergs πŸ”οΈβ„οΈ while trying to find the best path to the treasure πŸ†.

🌊Features: Users can click on any open space in the ocean/map to place icebergs πŸ”οΈβ„οΈ which are obstacles for the boat. Clicking on an iceberg that is already placed will result in removing that particular iceberg. Along with that there is a drop down menu with all four of the algorithm options and once an algorithm is chosen there is a side panel (which can be toggled to be shown or hidden) that displays the exact implementation the algorithm is running. Furthermore once the user runs the simulation of an algorithm the path it found will be highlighted on the map with its unique color to help distinguish different paths (Dijkstra's 🟠, BFS 🟣, DFS πŸ”΄, A* 🟒).

πŸ—οΈExplanation of each button:

πŸ”€Randomize - Places the treasure and the boat on random points on the map (maintains a distance of at least 10 nodes between the two).

βͺReset - Places the treasure and boat back to their original positions.

πŸ”€Clear IceBergs - Removes all of the IceBergs that were placed.

🚫Clear Path - Removes the highlighted path of previous algorithms to clean up the map.

❌Clear All - A combination of the other two clear buttons (clears everything of the map).

πŸƒRun - Starts the visualization of the selected algorithm.

🚦Stop - Run button transitions to a stop button once the algorithm is being visualized so clicking to will stop the simulation.

πŸ”§πŸ”©Libraries and Tools: NodeJs, React, JavaScript, HTML, CSS, react-codemirror2, GitHub pages.

🚧Additional information: While the algorithm is running unless the user clicks the stop button you cannot place any Icebergs, select another algorithm, and click any button aside from the Stop button. Also there is a swaying animation applied to the boat and IceBergs which also have a rippling animation to give the sense that they are floating in the water.

🎨User Interface:

Website Interface Screenshot

About

🌊 A tool that can help visualize four different graph traversal algorithms (Dijkstra's , BFS, DFS, and A*) through simulating a boat β›΅ in the ocean attempting to avoid icebergs πŸ”οΈ while trying to find the best path to the treasure πŸ†.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published