3

String split is done, and it can create a Graph class path object.
I now need to build the adjacency matrix.
Then I will work out the remaining prompts.
After that, I will start the algorithm for lowest cost.