bdschnapp / dijkstra-shortest-path Goto Github PK
View Code? Open in Web Editor NEWDeveloped at the University of Waterloo for MTE 140 - Algorithms and Data Structures, Summer 2019.A weighted edge graph data structure that uses dijkstra's shortest path algorithm to find the shortest distance between two nodes.