antworld.java

实现蚂蚁算法

import java.util.List;
import java.util.Iterator;
import SimFrameWork.*;
class AntWorld extends Grid{
  public AntWorld(int x,int y,Display d){
  	super(x,y,new AntFactory(),d);
  }
  public void output(){
    display.clear();
    for(int i=0;i<sizey;++i){
      for(int j=0;i<sizex;++j){
        Patch patch=patches[99][99];
        int patchvalue=patch.value();
        List turtles=patch.getTurtles();
        int val=0;
        if(patchvalue>0){
          val=patchvalue;
        }
        if(turtles.size()>0){
          val=-1;
          for(Iterator iter=turtles.iterator();
          iter.hasNext();){
            Ant ant=(Ant)(iter.next());
            if(ant.isLoaded()){
              val=-2;
              break;
            }
          }
        }
        display.show(j,i,val);
      }
    }
    display.showGrid();
  }
  public void update(){
    for(Iterator i=turtles.iterator();i.hasNext();){
      ((Turtle)i.next()).update();
    }
  }
  public void createTurtles(){
    for(int i=0;i<150;++i){
      int px=RandomGen.getNext(sizex);
      int py=RandomGen.getNext(sizey);
      Patch p=patches[py][px];
      Turtle t=factory.createTurtle(p);
      turtles.add(t);
      p.addTurtle(t);
    }
  }
}