Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public static void DijkstraOnNode (int start) {
- int[] dist = new int [myNodes.size()]; //where myNodes is an ArrayList of Hashset<Link>
- //and Link is a class that contains node kai weight
- int[] pred = new int [myNodes.size()];
- int[] pq = new int [myNodes.size()];
- for (int i = 0; i <= myNodes.size(); i++) {
- if (i!= start)
- dist[i] = Integer.MAX_VALUE;
- else
- dist[i] = 0;
- pq[i] = dist[i];
- }
- for (int i = 0; i <= myNodes.size(); i++)
- for (int i = 0; i < myNodes.size(); i++)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement