C project in visual studio 2022 using OpenGL , showcasing popular path algorithms.
https://github.com/cohenyuval315/Path-Algorithms/blob/main/Graphics/main.cpp
bool INIT_MAZE = true; // Default=True - Show the maze in the console
bool INIT_GRAPH = true; // Default=True - Show the graph and its nodes in the console, cannot be used with INIT_MAZE (MAZE overides)
- using context menu , you can choose the path algorithm
- Breadth-first search:
- unknown target position.
- searching through all tiles at each depth level before continuing to the next depth level.
- Depth-first search:
- unknown target position.
- search though the deepest depth level tile along each branch before backtracking.
- Best-first search:
- known target position.
- greedily prioritize tiles by target poisiton from a starting point ,and search though all tiles at each depth level before continuing to the next depth level.
- Astar:
- known target position.
- explore tiles by considering multiple paths from a starting point to a target ,and selects the shortest path based on heuristic estimates.
- Uniform Cost Search:
- variant of Dijkstra's algorithm.
- explores the graph by considering paths with the lowest cumulative cost from the starting point to each node.
- in the video , you cant see the context menu , at first i used bf then dfs then astar