File fscan=new File(ioparm.f_input);
Scanner input=new Scanner(fscan);
String line;
while ((line=input.nextLine())!=null) { // read friendship pair (s,f)
if(line.equals("END")){
break;
}
String[] se=line.split("\t");
s=Integer.parseInt(se[0]);
f=Integer.parseInt(se[1]);
//w=Integer.parseInt(se[2]);
numlinks++; // count number of edges
if (f < s) { t = s; s = f; f = t; } // guarantee s < f
if (f > numnodes) { numnodes = f; } // track largest node index
if (t2-t1>ioparm.timer) { // check timer; if necessarsy, display
System.out.println(" edgecount: ["+numlinks+"]");
t1 = t2; //
ioparm.timerFlag = true; //
} //
}
input.close();