Advertisement
Guest User

Untitled

a guest
Apr 23rd, 2014
42
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.56 KB | None | 0 0
  1. public static void DijkstraOnNode (int start) {
  2.  
  3. int[] dist = new int [myNodes.size()]; //where myNodes is an ArrayList of Hashset<Link>
  4. //and Link is a class that contains node kai weight
  5. int[] pred = new int [myNodes.size()];
  6. int[] pq = new int [myNodes.size()];
  7.  
  8. for (int i = 0; i <= myNodes.size(); i++) {
  9.  
  10. if (i!= start)
  11. dist[i] = Integer.MAX_VALUE;
  12. else
  13. dist[i] = 0;
  14.  
  15. pq[i] = dist[i];
  16. }
  17.  
  18. for (int i = 0; i <= myNodes.size(); i++)
  19.  
  20. for (int i = 0; i < myNodes.size(); i++)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement