I am working on Problem 1 from the CROATIAN HIGH SCHOOL COMPETITIONS IN INFORMATICS 2014 Final Exam #2.
I don't understand the part of the solution about transforming the original edges into nodes. How do we find the shortest path after the transformation? What is stored in each node of the new graph? An explanation with example would be appreciated.