Alfar1 December 30, 2020 Launch Widget Pathfinding Visualizer Features: Weighted and unweighted algorithms Dijkstra’s algorithm (weighted) The father of pathfinding algorithms, it creates a tree of shortest paths from the starting vertex, the source, to all other points in the graph. Guarantees the shortest path! A* Search algorithm (weighted) One of the best and a popular technique used in path-finding and graph traversals with heuristic. Guarantees the shortest path! Breadth-First Search (unwighted) The algorithm starts at the tree root, and explores all of the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level. Guarantees the shortest path! Depth-First Search (unwighted) The algorithm starts at the root node and explores as far as possible along each branch before backtracking. Does not guarantee the shortest path! Maze generation Two methods to generate a maze: Recursive Division Random checkout the repo here for code! #Visualizer #Pathfinding #3d Like - 1 Likes Log in to like! Comments... Log in to add a comment! No comments yet...