parc ours profond eur

Post on 05-Nov-2015

213 Views

Category:

Documents

1 Downloads

Preview:

Click to see full reader

DESCRIPTION

niakha niakha

TRANSCRIPT

public void parcoursProfondeur(){LinkedList pile=new LinkedList();ArrayList marqu=new ArrayList();Point x,p =new Point("A");pile.push(p);x=pile.peek();while(x!=null){if(!marqu.contains(x)){for(Liste_de_point l : liste_adjacence){if(l.getPoint().getNom().equals(p.getNom())){for(Point q : l.getListe()){if(!pile.contains(q) && !marqu.contains(q)){pile.push(q);}}}}marqu.add(pile.peek());}else{pile.pop();}x=pile.peek();}for(Point q : marqu){System.out.println(q);}}}public class Point{String nom;public String getNom() {return nom;}public void setNom(String nom) {this.nom = nom;}public Point(String nom) {super();this.nom = nom;}public Point() {super();}@Overridepublic int hashCode() {final int prime = 31;int result = 1;result = prime * result + ((nom == null) ? 0 : nom.hashCode());return result;}@Overridepublic boolean equals(Object obj) {if (this == obj)return true;if (obj == null)return false;if (getClass() != obj.getClass())return false;Point other = (Point) obj;if (nom == null) {if (other.nom != null)return false;} else if (!nom.equals(other.nom))return false;return true;}@Overridepublic String toString() {return nom;}}

top related