Discover published sets by community

The Bellman-Ford Algorithm calculates shortest paths from a single source vertex to all other vertices in a weighted digraph. It's capable of handling graphs with negative weight edges. Example use-case: Dynamic routing systems where routes have varying costs.

A* Search is used to find the shortest path between nodes in a graph. It combines features of DFS, BFS, and adds a heuristic to improve the search efficiency. Example use-case: Pathfinding in games and robotics.

Dijkstra's Algorithm is a method for finding the shortest paths between nodes in a weighted graph. It assumes non-negative edge weights. Example use-case: GPS navigation to find the shortest route.

BFS explores the neighbor nodes (children) before moving to the next level neighbors. It's implemented using a queue. Example use-case: To find the shortest path in an unweighted graph.