JAVA×î¶Ì·¾¶´úÂë

import java.util.LinkedList;
import java.util.List;
public class ShortestPaths {
     private static String showPath[] = { "", "", "", "", "", "" }; 
      
         // ·µ»ØͼµÄ×î¶Ì·¾¶ 
         public static int[] getShortPath(int path[][]) { 
            LinkedList<Integer> savePath = new LinkedList<Integer>();// ÓÃÓÚ±£´æÒÑÌí¼Ó½øÀ´µÄ½Úµã 
            int mark = 1; 
             int shortestPath[] = new int[path.length]; 
             for (int i = 0; i < shortestPath.length; i++) { 
                 shortestPath[i] = -1; 
             } 
             savePath.add(new Integer(0)); 
             if (savePath.size() == 1) { 
                 int num = savePath.getLast().intValue(); 
                 int minIndex = 0; 
                 for (int j = 0; j < shortestPath.length; j++) { 
                     shortestPath[j] = path[num][j];