Pathfinding Algorithms Visualization | Dijkstra's | A* (A star) | Greedy BFS (UCS) | BFS | DFS

This video presents realistic Pathfinding or pathing is the plotting, by a computer application, of the shortest route between two points. Blind search algorithms such as breadth-first and depth-first exhaust all possibilities; starting from the given node, they iterate over all possible paths until they reach the goal node. These algorithms run in O(V+E), or linear time, where V is the number of vertices, and E is the number of edges between vertices. Algorithms such as Greedy, Dijkstra’s algorithm, and A* eliminate paths either using educated guesses(heuristics) or distance from source to node V to find the optimal path. By eliminating impossible paths, these algorithms can achieve time complexities as low as O(E log(V)).

website: https://sites.google.com/view/eliteai...

0:00 A* (A star) Algorithm
0:18 Dijkstra's Algorithm (also called Uniform Cost Search)
0:43 Greedy Breadth First Search
0:48 Enhanced Uniform Cost Search
1:25 Breadth First Search
1:49 Depth First Search