Single Source, Shortest Path
Given a graph G = (V, E) and a vertex s ? V, find the shortest path from s to every vertex in V
Many variations:
- weighted vs. unweighted
- cyclic vs. acyclic
- positive weights only vs. negative weights allowed
- multiple weight types to optimize