BFS正确的算法

 public double getPowerBFSTraverse(Shape root) {

  _GraphVisitor visitor = new _GraphVisitor();

  Queue<Shape> q = new LinkedList<Shape>();
  q.add(root);

  Shape s;

  while (!q.isEmpty()) {
   s = q.remove();
   visitor.visit(s);
   for (Shape p : edgeQueue.getConnectedShapes(s)) {
    if (!visitor.isVisited(p) && !q.contains(p))
     q.add(p);
   }
  }
  return visitor.getResult();
 }