class PlanarGraph extends AnyRef
- Alphabetic
- By Inheritance
- PlanarGraph
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new PlanarGraph()
- new PlanarGraph(nodeFact: NodeFactory)
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def add(e: EdgeEnd): Boolean
- def addEdges(edgesToAdd: List[Edge]): Unit
Add a set of edges to the graph.
Add a set of edges to the graph. For each edge two DirectedEdges will be created. DirectedEdges are NOT linked by this method.
- def addNode(coord: Coordinate): Node
- def addNode(node: Node): Node
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- var edgeEndList: ArrayList[EdgeEnd]
- Attributes
- protected
- var edges: ArrayList[Edge]
- Attributes
- protected
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def find(coord: Coordinate): Node
return the node if found; null otherwise
- def findEdge(p0: Coordinate, p1: Coordinate): Edge
Returns the edge whose first two coordinates are p0 and p1
Returns the edge whose first two coordinates are p0 and p1
return the edge, if found
nullif the edge was not found - def findEdgeEnd(e: Edge): EdgeEnd
Returns the EdgeEnd which has edge e as its base edge (MD 18 Feb 2002 - this should return a pair of edges)
Returns the EdgeEnd which has edge e as its base edge (MD 18 Feb 2002 - this should return a pair of edges)
return the edge, if found
nullif the edge was not found - def findEdgeInSameDirection(p0: Coordinate, p1: Coordinate): Edge
Returns the edge which starts at p0 and whose first segment is parallel to p1
Returns the edge which starts at p0 and whose first segment is parallel to p1
return the edge, if found
nullif the edge was not found - final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def getEdgeEnds: ArrayList[EdgeEnd]
- def getEdgeIterator: Iterator[Edge]
- def getNodeIterator: Iterator[Node]
- def getNodes: Collection[Node]
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def insertEdge(e: Edge): Boolean
- Attributes
- protected
- def isBoundaryNode(geomIndex: Int, coord: Coordinate): Boolean
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def linkAllDirectedEdges(): Unit
- def linkResultDirectedEdges(): Unit
Link the DirectedEdges at the nodes of the graph.
Link the DirectedEdges at the nodes of the graph. This allows clients to link only a subset of nodes in the graph, for efficiency (because they know that only a subset is of interest).
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- var nodes: NodeMap
- Attributes
- protected
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def printEdges(out: PrintStream): Unit
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()