Research, design, and implement graph/pathfinding algorithms
Opened this issue · 0 comments
AndrewZhang126 commented
Implement popular graph/pathfinding algorithms. These can include
- Depth First Search (DFS)
- Breadth First Search (BFS)
- Dijkstra
- Floyd Warshall
- Prim
- Kruskal
- Topological sort
among others. This requires an entirely new interface where instead of an array, we display a grid, where each grid cell will be highlighted a different color depending on the process of the algorithm (refer to Pathfinding Visualizer for a good reference/idea). This task requires further research of what algorithms to consider, how to design the page for the user, and how to implement the visual aspects of the grid.