hi. im new to this forum, it roks btw. i need help with the translation of this pseudocode please:
Code:for each vertex v { set kv to false set pv to unknown (or none, if v is the start vertex) set dv to infinity (or 0, if v is the start vertex) } PriorityQueue pq = new PriorityQueue() pq.enqueue(start vertex, 0) while (!pq.isEmpty()) { vertex v = pq.dequeueMin(); if (kv is false) { kv = true for each vertex w such that edge v -> w exists { if (dw > dv + C(v, w)) { dw = dv + C(v, w) pw = v pq.enqueue(w, dw) } } } }


. i need help with the translation of this pseudocode please:
Reply With Quote


Bookmarks