public Dijkstra() {
		for(int i=0;i<maxnode;i++)node[i]=new Node();
		routelen=1;nodelen=1;
		for(int i=0;i<maxn;i++)route[i]=new Route();
		time1=new double[maxnode][maxnode];
		distanceTwoNodes=new double[maxnode][maxnode];
		leastTimeTrack=new int[maxnode][maxnode];
		for(int i=0;i<maxnode;i++)
			for(int j=0;j<maxnode;j++){
				gra[i][j]=false;
				time1[i][j]=INFDOUBLE;
				if(i!=j)
					distanceTwoNodes[i][j]=INFDOUBLE;
				else distanceTwoNodes[i][j]=0;
			}
//		inputget();
		readthefile in=new readthefile();
		in.run();
		
	}