# Shortest Path in a Graph

Jump to navigation
Jump to search

# External

- https://www.coursera.org/learn/algorithms-graphs-data-structures/lecture/ZAaJA/bfs-and-shortest-paths
- 5 Ways to Find the Shortest Path in a Graph https://betterprogramming.pub/5-ways-to-find-the-shortest-path-in-a-graph-88cfefd0030f

# Internal

# Overview

There are several algorithms that compute the shortest path between two vertices in a graph, and they can be used or not depending on the characteristics of the graph, such as whether is directed or undirected, the edges have weights, the weights are negative or not.

# Shortest Path Algorithms

- Breadth-First Search-based Shortest Path Algorithm
- Dijkstra's Shortest-Path Algorithm
- Bellman-Ford Shortest-Path Algorithm
- Shortest Path with Bidirectional Search