Dan graph. It is necessary to find a path consisting of edges of minimal length. But, as I understand it, the shortest path does not necessarily contain edges of minimal length (for example, you can go along one edge to the desired vertex, but you can bypass several, but smaller ones). What algorithms exist to find the path I need? Thank you in advance.
1 answer
Here is what came to mind:
- Floyd-Worshel Algorithm
- Ford-Bellman algorithm
- Dijkstra's Algorithm
- Dijkstra's Algorithm for Sparse Graphs
- Wave algorithm
huffman huffman
1,829 1 golden mark 7 silver marks 11 bronze marks
- lecture on YouTube Lecture 3: Algorithms and methods for finding the shortest path in the column youtube.com/watch?v=ek721aS3CRE - huffman
|