题
package package1;
import java.util.Arrays;
class List {
int[] weight;
int[] sortYes;
String[] str;
public List(int n) {
weight = new int[n];
sortYes = new int[n];
str = new String[n];
for (int i = 0; i < n; i++) {
weight[i] = Integer.MAX_VALUE;
sortYes[i] = Integer.MAX_VALUE;
}
}
}
public class alg {
public static void dijkstra(int[][] g, List list, boolean direction) {
list.sortYes[0] = 0;
while(list.sortYes[min(list.sortYes)] != Integer.MAX_VALUE){
int point = min(list.sortYes);
list.sortYes[point] = Integer.MAX_VALUE;
for(int i = 1; i < g[0].length; i++){
if(g[point][i] != 0){
if( point == 0