public void computeEdgeEnds(Edge edge,List l){
  EdgeIntersectionList eiList=edge.getEdgeIntersectionList();
  eiList.addEndpoints();
  Iterator it=eiList.iterator();
  EdgeIntersection eiPrev=null;
  EdgeIntersection eiCurr=null;
  if (!it.hasNext())   return;
  EdgeIntersection eiNext=(EdgeIntersection)it.next();
  do {
    eiPrev=eiCurr;
    eiCurr=eiNext;
    eiNext=null;
    if (it.hasNext())     eiNext=(EdgeIntersection)it.next();
    if (eiCurr != null) {
      createEdgeEndForPrev(edge,l,eiCurr,eiPrev);
      createEdgeEndForNext(edge,l,eiCurr,eiNext);
    }
  }
 while (eiCurr != null);
}

public void computeEdgeEnds ( Edge edge , List l ) { EdgeIntersectionList eiList = edge . getEdgeIntersectionList ( ) ; eiList . addEndpoints ( ) ; Iterator it = eiList . iterator ( ) ; EdgeIntersection eiPrev = null ; EdgeIntersection eiCurr = null ; if ( ! it . hasNext ( ) ) return ; EdgeIntersection eiNext = ( EdgeIntersection ) it . next ( ) ; do { eiPrev = eiCurr ; eiCurr = eiNext ; eiNext = null ; if ( it . hasNext ( ) ) eiNext = ( EdgeIntersection ) it . next ( ) ; if ( eiCurr != null ) { createEdgeEndForPrev ( edge , l , eiCurr , eiPrev ) ; createEdgeEndForNext ( edge , l , eiCurr , eiNext ) ; } } while ( eiCurr != null ) ; }
creates stub edges for all the intersections in this edge ( if any ) and inserts them into the graph .
