Programming Challenge: Implementing Dijkstra's

Problem Statement

Given an adjacency matrix in a 2D array, solve the Single Source Shortest Path algorithm, essentially by implementing the Dijkstra’s algorithm discussed in the previous lesson. We’ve written some skeleton code for the function.

1. The value of the weight of the

...