Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- for (int i = 1; i <= n; i++) {
- Q.offer(TAB[i]);
- }
- while (!Q.isEmpty()) {
- FVertex u = Q.poll();
- for (Vertex v : u.l) {
- if (TAB[v.V].d > u.d + v.w) {
- TAB[v.V].d = u.d + v.w;
- Q.remove(TAB[v.V]);
- Q.offer(TAB[v.V]);
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement