@Carl Love I really just need this better represented visually to include in the maps section of my report. Is there really no function in Maple that spreads vertices away from each other to avoid overlapping?

@Carl Love I just applied your code and switched the RandomgGraph part with the Graph I have made for my London system metro analysis where each station is represented as a vertex. I seem to be getting this this error:
 

@Carl Love  Hi, sorry for the delayed response.

I have attempted your code however it makes an even more clustered and unintelligible graph plot. I don't have many degree 1 nodes so I am assuming this didn't affect the degree 2 nodes as we wanted it to.

@Carl Love 194

This is the graph maple produced

@Kitonum I am rather new to coding so the idea of doing it this way was beyond me, I assumed there was a command. Thank you for providing me with the example, I will try implementing it to my code.

Hey guys, I was able to find a pseudocode which carries out this specific function alongside using AllPairsDistance(G).

This is a modifer for the algorithm for the case of unweighted graphs:

procedure Path(u, v)
   if next[u][v] = null then
       return []
   path = [u]
   while u ≠ v
       u ← next[u][v]
       path.append(u)
   return path

How would I convert this into maple syntax?

@Carl Love Thank you! I was able to make the code work this time!