15 Reputation

One Badge

0 years, 202 days

MaplePrimes Activity

These are replies submitted by Scythor

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]
   return path

How would I convert this into maple syntax?

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

Page 1 of 1