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.jgrapht.traverse.BreadthFirstIterator

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

View Full Code Here

Examples of org.jgrapht.traverse.BreadthFirstIterator

    /*
     * Now, to recreate the newick file's node sorting. We previously recorded the "first" child
     * node for each parent node, which we'll now use to determine whether we want to sort that
     * node in forward or reverse.
     */
    BreadthFirstIterator dfi = new BreadthFirstIterator(tree, tree.getRoot());
    while (dfi.hasNext()) {
      Object p = dfi.next();
      if (!tree.isLeaf(p)) {
        tree.sorting.put(p, RootedTree.REVERSE);
        List l = tree.getChildrenOf(p);
        if (l.get(0) != firstChildren.get(p)) tree.sorting.put(p, RootedTree.FORWARD);
      }

View Full Code Here

Examples of org.jgrapht.traverse.BreadthFirstIterator

    /*
     * Now, to recreate the newick file's node sorting. We previously recorded the "first" child
     * node for each parent node, which we'll now use to determine whether we want to sort that
     * node in forward or reverse.
     */
    BreadthFirstIterator dfi = new BreadthFirstIterator(tree, tree.getRoot());
    while (dfi.hasNext()) {
      Object p = dfi.next();
      if (!tree.isLeaf(p)) {
        tree.sorting.put(p, RootedTree.REVERSE);
        List l = tree.getChildrenOf(p);
        if (l.get(0) != firstChildren.get(p)) tree.sorting.put(p, RootedTree.FORWARD);
      }

View Full Code Here

Examples of prefuse.data.util.BreadthFirstIterator

        super(group);
        m_sources = sources;
        m_distance = distance;
        m_groupP = new InGroupPredicate(
            PrefuseLib.getGroupName(group, Graph.NODES));
        m_bfs = new BreadthFirstIterator();
    }

View Full Code Here

Examples of prefuse.data.util.BreadthFirstIterator

        super(group);
        m_sources = sources;
        m_distance = distance;
        m_groupP = new InGroupPredicate(
            PrefuseLib.getGroupName(group, Graph.NODES));
        m_bfs = new BreadthFirstIterator();
    }

View Full Code Here

Examples of prefuse.data.util.BreadthFirstIterator

    /**
     * Clears references to graph tuples.  The group and visualization are
     * retained.
     */
    public void reset() {
      m_bfs = new BreadthFirstIterator();
    }

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.