()
| 88 | } |
| 89 | |
| 90 | private int getNextNode() { |
| 91 | int min_value = INF; |
| 92 | int node_idx = 0; |
| 93 | for (int i = 1; i <= N; i++) { |
| 94 | if (!visited[i] && D[i] < min_value) { |
| 95 | min_value = D[i]; |
| 96 | node_idx = i; |
| 97 | } |
| 98 | } |
| 99 | return node_idx; |
| 100 | } |
| 101 | |
| 102 | private void printDistance() { |
| 103 | for (int i = 1; i <= N; i++) { |