Hi I have a graph with vertices and weights like so:
Atlanta -> Dallas 500
Boston -> Atlanta 600 Chicago 200
Chicago -> Boston 800
If there is no connection between two nodes the value is 5000. What is the easiest way to implement a shortest path algorithm on this type of data?
Atlanta -> Dallas 500
Boston -> Atlanta 600 Chicago 200
Chicago -> Boston 800
If there is no connection between two nodes the value is 5000. What is the easiest way to implement a shortest path algorithm on this type of data?