Contribute to ITrickStar/Dijkstra-s-Algorithm-using-adjacency-list-and-k-ary-heap development by creating an account on GitHub. Skip to content. Navigation Menu Toggle navigation. Sign in ...

Dijkstra's algorithm is a classic algorithm for finding the shortest path between two points due to its optimisation capability. The adjacency matrix is the naive storage structure of the algorithm.

Dijkstra's algorithm is a classic algorithm for finding the shortest path between two points due to its optimisation capability. The adjacency matrix is the naive storage structure of the algorithm.