0 Comments
The Dijkstra's Algorithm (shortest route) finds the shortest distance and path from a source to all destination in a directed graph which is defined by a set of vertexes (V) and a collection of edges.
I found the easiest way to understand how Dijkstra's algorithm works is to take a look at this visual explanation below: |
Categories
All
Archives
May 2020
|
RSS Feed
in loving memory of my mother and my 4th aunt