Find the cheapest route between subway stations

Asked Jun 13 '17 at 09:06

Active Jun 13 '17 at 09:10

Viewed 82 times

Hello i am currently confused with a question and hopefully would like to receive some advice on how to start it. Below I drew out a map with the destinations and prices

                                             6    4 
                                          c  <-b <-a
                                        1 ^        | 1
                                          |        v
                                          g<-f<-e<-d 
                                           1   1   1

so based on this map, I am supposed to find the cheapest route from point a to point c but im not sure exactly how to start this question and what I would label my destinations in terms of the price

asked Jun 13 '17 at 09:06

BrianStolars

1

you should implement djikstra's algorithm – Daniel Puiu Jun 13 '17 at 09:07
2

https://en.wikipedia.org/wiki/Shortest_path_problem – Avihoo Mamka Jun 13 '17 at 09:07
1

Possible duplicate of [Cheapest path algorithm](https://stackoverflow.com/questions/2207987/cheapest-path-algorithm) – Avihoo Mamka Jun 13 '17 at 09:08

Find the cheapest route between subway stations

0 Answers0