/** * Returns the DirectedEdges, in ascending order by angle with the positive x-axis. */ public List getEdges() { sortEdges(); return outEdges; }
/** * Returns an Iterator over the DirectedEdges, in ascending order by angle with the positive x-axis. */ public Iterator iterator() { sortEdges(); return outEdges.iterator(); }
/** * Returns the zero-based index of the given DirectedEdge, after sorting in ascending order * by angle with the positive x-axis. */ public int getIndex(DirectedEdge dirEdge) { sortEdges(); for (int i = 0; i < outEdges.size(); i++) { DirectedEdge de = (DirectedEdge) outEdges.get(i); if (de == dirEdge) return i; } return -1; } /**
/** * Returns the zero-based index of the given Edge, after sorting in ascending order * by angle with the positive x-axis. */ public int getIndex(Edge edge) { sortEdges(); for (int i = 0; i < outEdges.size(); i++) { DirectedEdge de = (DirectedEdge) outEdges.get(i); if (de.getEdge() == edge) return i; } return -1; } /**
/** * Returns the DirectedEdges, in ascending order by angle with the positive x-axis. */ public List getEdges() { sortEdges(); return outEdges; }
/** * Returns an Iterator over the DirectedEdges, in ascending order by angle with the positive x-axis. */ public Iterator iterator() { sortEdges(); return outEdges.iterator(); }
/** * Returns the zero-based index of the given DirectedEdge, after sorting in ascending order * by angle with the positive x-axis. */ public int getIndex(DirectedEdge dirEdge) { sortEdges(); for (int i = 0; i < outEdges.size(); i++) { DirectedEdge de = (DirectedEdge) outEdges.get(i); if (de == dirEdge) return i; } return -1; } /**
/** * Returns the zero-based index of the given Edge, after sorting in ascending order * by angle with the positive x-axis. */ public int getIndex(Edge edge) { sortEdges(); for (int i = 0; i < outEdges.size(); i++) { DirectedEdge de = (DirectedEdge) outEdges.get(i); if (de.getEdge() == edge) return i; } return -1; } /**