import java.util.Vector;

public class Cnode extends Object {
 static int node[];
 static int nnode[];
 static int tdnode[][];
 static int label[];
 double distance1[];

 public Cnode(){
 }

 public Cnode(double[][] x, int n){
  distance1 = new double[n];
  for (int k=1; k<n; k++)
   distance1[k]=x[k][2]; 
 }


 public void ComputeNode(int A[], int n) { 
  for (int kk=1; kk<=n; kk++) node[kk]=1;
  for (int kk=1; kk<n; kk++) {
   node[A[kk]]=node[A[kk]]+1;
  }
 }

 public void ComputeNode1(int A[], int n, int max){
  tdnode=new int[n+1][max+1];
  for (int k=1; k<=n; k++)
   for (int kk=2; kk<=max; kk++) tdnode[k][kk]=0;
  for (int k=1; k<n; k++)
   tdnode[k][1]=A[k];
  for (int i=1; i<=n-1; i++){
   if (node[A[i]] > 1) {
    for (int j=2; j<= node[A[i]]; j++) {
     if (tdnode[A[i]][j]==0) {
      tdnode[A[i]][j]=i;
      break;
  }}}}
  for (int j=1; j<=node[n]; j++) tdnode[n][j]=tdnode[n][j+1];
  node[n]=node[n]-1;
 }

 public void Label(int A[],int n, boolean F[], int max){
  int count=1;
  int nc=1;
  boolean b1=false;
  boolean b2=false;
  label=new int[n+1];
  for (int k=1; k<=n; k++) label[k]=0;
  Vector stack=new Vector();
  int[] consume=new int[n+1];
  for (int jj=1; jj<n; jj++) consume[jj]=node[jj];
  int i=1;
  stack.addElement(Integer.valueOf(Integer.toString(i)));
  label[i]=nc;
  int j=1;
  
  while(true){
   while(j<=node[i]){
    if (label[tdnode[i][j]]!=0) {
     j=j+1; 
     consume[i]=consume[i]-1;
    } else {
     if (i==n) b1=false;
     if (tdnode[i][j]==n) b2=false;
     if (i !=n && tdnode[i][j] !=n){
     b1= (A[i]==tdnode[i][j] && F[i]==true);
     b2= (A[tdnode[i][j]]==i && F[tdnode[i][j]]==true); 
     } 
     if (b1 | b2) {
      nc++;
      label[tdnode[i][j]]=nc;
     } else {label[tdnode[i][j]]=label[i];}
     stack.addElement(Integer.valueOf(Integer.toString(tdnode[i][j])));   
     consume[i]=consume[i]-1;
  
     if (node[tdnode[i][j]]==1) {
      consume[tdnode[i][j]]=consume[tdnode[i][j]]-1;
      j++;
     } else {i=tdnode[i][j]; j=1;}
    }
   } //end while(j<=node[i])
   int k;

   for (k=stack.size()-1; k>=0; k--){
    if (consume[((Integer)stack.elementAt(k)).intValue()]>0) {
     i=((Integer)stack.elementAt(k)).intValue();
    break;}
   }
  if (stack.size()==n) break;
  j=node[i]-consume[i]+1;
  } //end while(true)
  }    
 

}