| 24 | } |
| 25 | |
| 26 | private static void dijkstra(Graph g, int src){ |
| 27 | int V = g.v; |
| 28 | int dist[] = new int[V]; |
| 29 | Arrays.fill(dist, Integer.MAX_VALUE); |
| 30 | dist[src] = 0; |
| 31 | boolean visited[] = new boolean[V]; |
| 32 | |
| 33 | |
| 34 | for(int i = 0 ; i < V; i ++){ |
| 35 | int u = minDist(dist,visited); |
| 36 | visited[u] = true; |
| 37 | |
| 38 | List<AdjNode> list = g.adjList.get(u); |
| 39 | for(AdjNode v : list){ |
| 40 | if(!visited[v.dest] && dist[u] + v.cost < dist[v.dest]){ |
| 41 | dist[v.dest] = dist[u] + v.cost; |
| 42 | } |
| 43 | } |
| 44 | } |
| 45 | |
| 46 | System.out.println("Vertex Distance from Source"); |
| 47 | for(int i = 0; i < dist.length; i++) |
| 48 | System.out.println(i + " " + dist[i]); |
| 49 | } |
| 50 | |
| 51 | private static int minDist(int dist[], boolean[] visited){ |
| 52 | int min = Integer.MAX_VALUE, min_index = -1; |