Package org.geotools.graph.structure

Examples of org.geotools.graph.structure.DirectedGraphable


  }

  public void cont(Graphable current, GraphTraversal traversal) {
    //increment the count of all adjacent nodes by one
    // if the result count equal to the degree, place it into the queue
    DirectedGraphable directed = (DirectedGraphable)current;
    for (Iterator itr = directed.getOutRelated(); itr.hasNext();) {
      DirectedNode related = (DirectedNode)itr.next();
      if (!traversal.isVisited(related)) {
        related.setCount(related.getCount()+1)
        if (related.getInDegree() == related.getCount()) m_queue.enq(related);
     
View Full Code Here


*/
public class DirectedDepthFirstIterator extends DepthFirstIterator {

  public void cont(Graphable current, GraphTraversal traversal) {
    //only consider outing going related
    DirectedGraphable dg = (DirectedGraphable)current;
    for (Iterator itr = dg.getOutRelated(); itr.hasNext();) {
      DirectedGraphable related = (DirectedGraphable)itr.next();
      if (!traversal.isVisited(related)) getQueue().enq(related)
    }
  }
View Full Code Here

*/
public class DirectedBreadthFirstIterator extends BreadthFirstIterator {

  public void cont(Graphable current, GraphTraversal traversal) {
    //only consider outing going related
    DirectedGraphable dg = (DirectedGraphable)current;
    for (Iterator itr = dg.getOutRelated(); itr.hasNext();) {
      DirectedGraphable related = (DirectedGraphable)itr.next();
      if (!traversal.isVisited(related)) getQueue().enq(related)
    }
  }
View Full Code Here

TOP

Related Classes of org.geotools.graph.structure.DirectedGraphable

Copyright © 2018 www.massapicom. All rights reserved.
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.