Dijkstra, Weighted Graph, Data Structure Algorithm, Algorithms, Graph Data Structure.
going to try to implement Dijkstra’s for the weighted graph, given below: We’re using an adjacency matrix to represent the graph, where the matrix has a positive entry if there’s a edge running between the two nodes(row and col), the value of graph[i][j] is the weight along the vertices i and j.