shortest path

2 articles · All tags

• Bellman–Ford Algorithm
  A single-source shortest path algorithm that handles negative edge weights and detects negative cycles, running in O(V×E) time.
• Dijkstra's Shortest Path Algorithm
  A greedy graph algorithm that finds the shortest paths from a single source vertex to all others in graphs with non-negative edge weights.