Advertisement
Guest User

Untitled

a guest
Jun 25th, 2019
66
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.11 KB | None | 0 0
  1. Distance(s, t):
  2. for each path p from s to t:
  3. compute w(p)
  4. return p encountered with smallest w(p)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement