Examples of BreadthFirstIterator

org._3pq.jgrapht.traverse.BreadthFirstIterator
org.geotools.graph.traverse.standard.BreadthFirstIterator
Iterates over the nodes of a graph in a Breadth First Search pattern starting from a specified node. The following illustrates the iteration order.

The iteration operates by maintaning a node queue of active nodes. An active node is a node that will returned at a later stage of the i teration. The node queue for a Breadth First iteration is implemented as a First In First Out queue. A node is placed in the the node queue if it has not been visited, and it is adjacent to a a node that has been visited. The node queue intially contains only the source node of the traversal. @author Justin Deoliveira, Refractions Research Inc, jdeolive@refractions.net @source $URL$
org.jgrapht.traverse.BreadthFirstIterator
A breadth-first iterator for a directed and an undirected graph. For this iterator to work correctly the graph must not be modified during iteration. Currently there are no means to ensure that, nor to fail-fast. The results of such modifications are undefined. @author Barak Naveh @since Jul 19, 2003
prefuse.data.util.BreadthFirstIterator
rg">jeffrey heer

Examples of org._3pq.jgrapht.traverse.BreadthFirstIterator

    }
    Tree tree = new cc.mallet.grmm.types.Tree ();
    Object root = g.vertexSet ().iterator ().next ();
    tree.add (root);


    for (Iterator it1 = new BreadthFirstIterator (g, root); it1.hasNext();) {
      Object v1 = it1.next ();
      for (Iterator it2 = g.edgesOf (v1).iterator (); it2.hasNext ();) {
        Edge edge = (Edge) it2.next ();
        Object v2 = edge.oppositeVertex (v1);
          if (tree.getParent (v1) != v2) {
            tree.addNode (v1, v2);

View Full Code Here

Examples of org._3pq.jgrapht.traverse.BreadthFirstIterator

  {
    JunctionTree jt = new JunctionTree (g.vertexSet ().size ());
    Object root = g.vertexSet ().iterator ().next ();
    jt.add (root);


    for (Iterator it1 = new BreadthFirstIterator (g, root); it1.hasNext ();) {
      Object v1 = it1.next ();
      for (Iterator it2 = GraphHelper.neighborListOf (g, v1).iterator (); it2.hasNext ();) {
        Object v2 = it2.next ();
        if (jt.getParent (v1) != v2) {
          jt.addNode (v1, v2);
        }

View Full Code Here

Examples of org.geotools.graph.traverse.standard.BreadthFirstIterator

        }
    }
    OrphanVisitor graphVisitor = new OrphanVisitor();
    
    SimpleGraphWalker sgv = new SimpleGraphWalker(graphVisitor);
    GraphIterator iterator = new BreadthFirstIterator();
    BasicGraphTraversal bgt = new BasicGraphTraversal(graph, sgv, iterator);
    
    bgt.traverse();
    
    System.out.println("Found orphans: " + graphVisitor.getCount());

View Full Code Here

Examples of org.jgrapht.traverse.BreadthFirstIterator

    }
  }


  void setStateRecursive(RootedTree tree, PhyloNode base, int state)
  {
    BreadthFirstIterator bfi = new BreadthFirstIterator(tree, base);
    while (bfi.hasNext())
    {
      PhyloNode n = (PhyloNode) bfi.next();
      n.setState(state);
    }
  }

View Full Code Here

Examples of org.jgrapht.traverse.BreadthFirstIterator

  }


  public int getMaxDepthToLeaf(Object vertex)
  {
    int maxDepth = 0;
    BreadthFirstIterator bfi = new BreadthFirstIterator(this, vertex);
    while (bfi.hasNext())
    {
      Object o = bfi.next();
      if (isLeaf(o))
      {
        int curDepth = getDepthToVertex(o, vertex);
        if (curDepth > maxDepth)
          maxDepth = curDepth;

View Full Code Here

Examples of org.jgrapht.traverse.BreadthFirstIterator

  }


  public double getMaxHeightToLeaf(Object vertex)
  {
    double maxHeight = 0;
    BreadthFirstIterator bfi = new BreadthFirstIterator(this, vertex);
    while (bfi.hasNext())
    {
      Object o = bfi.next();
      if (isLeaf(o))
      {
        double curHeight = getHeightToRoot(o);
        if (curHeight > maxHeight)
          maxHeight = curHeight;

View Full Code Here

Examples of org.jgrapht.traverse.BreadthFirstIterator

  }


  private List getEnclosedVertices(Object vertex)
  {
    ArrayList l = new ArrayList();
    BreadthFirstIterator bfi = new BreadthFirstIterator(this, vertex);
    while (bfi.hasNext())
    {
      l.add(bfi.next());
    }
    return l;
  }

View Full Code Here

Examples of org.jgrapht.traverse.BreadthFirstIterator

  }


  private List getEnclosedLeaves(Object vertex)
  {
    ArrayList l = new ArrayList();
    BreadthFirstIterator bfi = new BreadthFirstIterator(this, vertex);
    while (bfi.hasNext())
    {
      Object o = bfi.next();
      if (isLeaf(o))
        l.add(o);
    }
    return l;
  }

View Full Code Here

Examples of org.jgrapht.traverse.BreadthFirstIterator

    // System.out.println(this);
    // STEP 3: Re-orient all edges, branching out from the root edge.
    //
    // Iterate over an undirected version of this graph, so we can "go
    // against the grain" when we need to.
    BreadthFirstIterator bfi = new BreadthFirstIterator(Graphs
        .undirectedGraph(this), root);
    // Toss all the nodes into a linked list.
    LinkedList linked = new LinkedList();
    while (bfi.hasNext())
    {
      linked.addLast(bfi.next());
    }
    // Now, go through the list of nodes, re-orienting edges as needed.
    // Set the root node as the first parent in our algorithm.
    HashMap seen = new HashMap();
    Integer stupidInt = new Integer(1);

View Full Code Here

Examples of org.jgrapht.traverse.BreadthFirstIterator

   * 
   * @param vertex
   */
  public void reverseSubtree(Object vertex)
  {
    BreadthFirstIterator bfi = new BreadthFirstIterator(this, vertex);
    while (bfi.hasNext())
    {
      Object o = bfi.next();
      flipChildren(o);
    }
  }

View Full Code Here

0 1

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.