树的边

    final  static int UNDISCOVERED=0;
    final static  int  DISCOVERED=1;
    final static  int  VISITED=2;
    final static  int  UNKNWN=0;  //为指导的边
    final static  int  TREE=1;
    final  static int CROSS=2;
    final static  int FORWARD=3;
    final static int  BACKWARD=4;

    //变量
    protected  Graph g;


    //构造方法
    protected  void reset (Vertex s){

        for (Iterator it=G.vertices();it.hasNext()){

        }
    }