Nodo CrearLista(cadena){

Nodo cab, ult,aux;

cab=null;
ult=null;

StringTokenizer sTokens = new StringTokenizer(cadena);

while(sTokens.hasMoreTokens()) {
aux =new Nodo();
aux->valor=sTokens3.nextToken();
aux->sgte=null;
aux->flag=1;
if(cab==null){
cab=aux;
}else{
ult->sgte=aux;
}
ult=aux;
}
return cab;

}
public void leerGrafo(){
while(i<n){
lista[i]=CrearLista():
}
}
boolean void Euleriano(){
int encontrado=0;
Nodo p=camino;
while(p->sgte!=null && adyacente(p->valor,p->sig->valor)==true){
p=p->sgte;
}
for(int j=0;j<n;j++){
Nodo aux=lista[j];
while(aux!=null){
y=y+p->flag;
p=p->sgte;
}
}
return encontrado;