SHARE

TWEET

# pseudocode

a guest
Oct 23rd, 2018
80
Never

**Not a member of Pastebin yet?**

**, it unlocks many cool features!**

__Sign Up__- dijkstras shortest path algorithm pseudocode
- let s be starting vertex
- let c be set of all verticies minus s
- let d[v] = dist(s,v) and p[v] = s fr each v E c
- repeat until c is empty
- choose v from c that has minimum d[v] value
- let c = c - {v}
- for each neighbor w of v in c
- if d[v] + dist(v,w) < d[w]
- then let d[w] = d[v] + dist(v,w) and let p[w] = v

RAW Paste Data

We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy.