输出一条图的简单路径.docVIP

输出一条图的简单路径 public class Edge { Point root; Point link; Edge next; Edge() { next=null; } Edge(Point root,Point link) { this.root=root; this.link=link; } } public class G { Point[] points; int size; G() { points=new Point[1]; size=0; } private void stretch() { Point[] newpoints=new Point[points.length*2]; for(int i=0;ipoints.length;i++) newpoints[i]=points[i]; points=newpoints; } private boolean isFull() { return size==points.length; } void addpoint(Point p) { if(this.isFull()) this.stretch(); points[size]=p; size++; } boolean ispIn(int index) { for(int i=0;isize;i++) if(points[i].no==index) return true; return false; } boolean iseIn(Edge e) { Edge temp=new Edge(); temp=e.root.edge; while(temp!=null) { if(temp.equals(e)) return true; temp=temp.next; } return false; } void addedge(Edge edge) { if(edge.root.edge==null) edge.root.edge=edge; else { Edge temp=edge.root.edge; while(temp.next!=null) temp=temp.next; temp.next=edge; } } Point findp(int index) { for(int i=0;isize;i++) if(points[i].no==index) return points[i]; return null; } int getindex(Point p) { for(int i=0;isize;i++) if(points[i].equals(p)) return i; return 0; } boolean dfs(Point vi,Point vj,int l,Pointstack stack) { stack.push(vi); if(stack.size==l+1||vi==vj) if(stack.size==l+1vi==vj) return true; else return false; Edge p=vi.edge; while(p!=null) { if(!stack.isIn(p.link)) if(this.dfs(p.link,vj,l,stack)) return true; else stack.pop(); p=p.next; } return false; } Pointqueue bfs(Point vi,Point vj,int l,QQ qq) { Pointqueue pq=new Pointqueue(); pq.add(vi); qq.add(pq); Pointqueue temp=qq.remove(); while(true) { boolean flag=true; if(temp.size==l+1||temp.rear().equals(vj)) if(temp.size==l+1temp.rear().equals(vj)) return temp; else flag=false; if(flag) { Edge p=temp.rea