Shortest Path in a Graph: Difference between revisions
Jump to navigation
Jump to search
| Line 4: | Line 4: | ||
=Internal= | =Internal= | ||
* [[Graphs# | * [[Graphs#Graph_Algorithms|Graphs]] | ||
* [[Graph_Search#Breadth-First_Search_.28BFS.29|Graph Search | Breadth-First Search]] | * [[Graph_Search#Breadth-First_Search_.28BFS.29|Graph Search | Breadth-First Search]] | ||
=Overview= | =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. | 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. | ||
Revision as of 04:30, 9 November 2021
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.