(int[] prev, int s, int t)
| 62 | } |
| 63 | |
| 64 | private void print(int[] prev, int s, int t) { // 递归打印 s->t 的路径 |
| 65 | if (prev[t] != -1 && t != s) { |
| 66 | print(prev, s, prev[t]); |
| 67 | } |
| 68 | System.out.print(t + " "); |
| 69 | } |
| 70 | |
| 71 | public static void main(String[] args) { |
| 72 | Graph graph = new Graph(8); |