Guess that Algorithm!
This graph-traversal algorithm explores each branch as long as possible before backtracking.
DFS (Depth First Search)
This graph-traversal method explores all neighbors of a node before exploring further levels of nodes.
BFS (Breadth First Search)
This sorting algorithm has a worst case running time of O(n logn).
Merge Sort or Heap Sort
This algorithm finds the shortest path from a starting node to all other nodes in a weighted graph with non-negative edge weights.
Dijkstra's Algorithm
This path-finding algorithm combines BFS with a greedy search heuristic to find the least-cost path.