Advertisement
Guest User

dfs

a guest
Jul 12th, 2014
224
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 0.46 KB | None | 0 0
  1.     private void dfs(ListaGenerica<ListaGenerica<Vertice<Muni>>> recTot, ListaGenerica<Vertice<Muni>> recAct,Vertice<Muni> v,Grafo<Muni> g){
  2.         recAct.agregarFinal(v);
  3.         if(v.dato().esMuni())
  4.             recTot.agregarFinal(recAct);
  5.         else{
  6.             ListaGenerica<Arista<Muni>> ady = g.listaDeAdyacentes(v);
  7.             ady.comenzar();
  8.             while(!ady.fin()){
  9.                 Arista<Muni> a = ady.proximo();
  10.                 dfs(recTot,recAct,a.verticeDestino(),g);
  11.                 recAct.eliminar(recAct.tamanio());
  12.             }
  13.         }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement