Package org.geotools.graph.structure

Examples of org.geotools.graph.structure.Node


   * @see GraphGenerator#add(Object)
   */
  public Graphable add(Object obj) {
    Object[] objs = (Object[])obj;
   
    Node n1, n2;
   
    //look up first node and create if necessary
    if ((n1 = (Node)m_obj2graphable.get(objs[0])) == null) {
      n1 = getGraphBuilder().buildNode();
      n1.setObject(objs[0]);
     
      getGraphBuilder().addNode(n1);
      m_obj2graphable.put(objs[0], n1);
    }
   
View Full Code Here


  /**
   * @see GraphGenerator#get(Object)
   */
  public Graphable get(Object obj) {
    Object[] objs = (Object[])obj;
    Node n1 = (Node)m_obj2graphable.get(objs[0]);
    Node n2 = (Node)m_obj2graphable.get(objs[1]);
   
    return(n1.getEdge(n2))
  }
View Full Code Here

   * @see GraphGenerator#remove(Object)
   */
  public Graphable remove(Object obj) {
    Object[] objs = (Object[])obj;
   
    Node n1 = (Node)m_obj2graphable.get(objs[0]);
    Node n2 = (Node)m_obj2graphable.get(objs[1]);
   
    Edge e = n1.getEdge(n2);
    getGraphBuilder().removeEdge(e);
   
    return(e);
View Full Code Here

  /**
   * @see GraphBuilder#removeNodes(Collection)
   */
  public void removeNodes(Collection nodes) {
    for (Iterator itr = nodes.iterator(); itr.hasNext();) {
      Node n = (Node)itr.next();
      removeNode(n);
    }
  }
View Full Code Here

      add(e.getNodeA());
      add(e.getNodeB());
    }
    else {
      //walk is not empty, check to see if the last node is related to the edge
      Node last = getLast();
     
      if (last.equals(e.getNodeA())) {
        add(e.getNodeB());   
      }
      else if (last.equals(e.getNodeB())) {
        add(e.getNodeA())
      }
      else return(false);
    }
   
View Full Code Here

   */
  protected List buildEdges() {
    ArrayList edges = new ArrayList();
   
    for (int i = 1; i < size(); i++) {
      Node prev = (Node)get(i-1);
      Node curr = (Node)get(i);
     
      Edge e = curr.getEdge(prev);
     
      if (e != null) edges.add(e);
      else return(null)
    }
   
View Full Code Here

      //make a node by node comparision
      Iterator thisnodes = iterator();
      Iterator othernodes = other.iterator();
     
      while(thisnodes.hasNext()) {
        Node thisnode = (Node)thisnodes.next();
        Node othernode = (Node)othernodes.next();
       
        if (!thisnode.equals(othernode)) return(false);     
      }
      return(true);
    }
View Full Code Here

   * @see GraphGenerator#get(Object)
   */
  public Graphable get(Object obj) {
    LineSegment line = (LineSegment)obj;
   
    Node n1 = (Node)m_coord2count.get(line.p0);
    Node n2 = (Node)m_coord2count.get(line.p0);
   
    return(n1.getEdge(n2));
   
    //note: if there are identical lines in the graph then it is undefined
    //which of them will be returned
View Full Code Here

    return((Node)m_coord2count.get(c));
   
  }

  public Edge getEdge(Coordinate c1, Coordinate c2) {
    Node n1 = (Node)m_coord2count.get(c1);
    Node n2 = (Node)m_coord2count.get(c2);
   
    return(n1.getEdge(n2))
  }
View Full Code Here

    }
   
    //check if object stream is empty, if not, there are nodes of degree 0
    // in the graph
    try {
      Node n;
     
      while((n = (Node)objin.readObject()) != null) {
        builder.addNode(n)
     
    }
View Full Code Here

TOP

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

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.