贪心算法——最小生成树 Prim算法 Java

import java.util.Scanner;
 
public class prim1 {
 
	public static void main(String[] args) {
		int [][] s=new int[100][100];
		int i,j;
		int counter=2,startmin=1000;
		for( i=0;i<100;i++)
		{
			for( j=0;j<100;j++)
			{
				if(i==j)
				{
					s[i][j]=0;
				}
				else
				{
					s[i][j]=1000;
				}
			}
		}
		int [] inthis=new int[100];
		int [] tag=new int[100];
		for( i=0;i<100;i++)
		{
			tag[i]=1;
		}
		Scanner in=new Scanner(System.in);
		System.out.println("请输入点的数目");
		int n=in.nextInt();
		System.out.println("请输入无向边,输入为0 0 0表示结束输入");
		int x=in.nextInt();
		int y=in.nextInt();
		int num=in.nextInt();
		for(;!(x==0&&y==0);)
		{
			if(num<startmin)
			{
				startmin=num;
				inthis[1]=x;
				inthis[2]=y;
			}
			s[x][y]=num;
			s[y][x]=num;
			 x=in.nextInt();
			 y=in.nextInt();
			 num=in.nextInt();
			 
		}
		tag[inthis[1]]=0;
		tag[inthis[2]]=0;
		System.out.println(inthis[1]+" "+inthis[2]+"  "+startmin);
		int tmp=1000;
		int p=0,q=0;
		while(counter<=n)
		{
			for( i=1;i<=counter;i++)
			{
				for(j=1;j<=n;j++)
				{
					if((s[inthis[i]][j]<tmp)&&tag[j]==1&&tag[inthis[i]]==0)
					{
						tmp=s[inthis[i]][j];
							p=inthis[i];
							q=j;
						
					}
				}
			}
			System.out.println(p+" "+q+"  "+tmp);
			counter++;
			tag[q]=0;
			tmp=1000;
			inthis[counter]=q;
		}
	}
 
}