| java.lang.Object
 com.vividsolutions.jts.planargraph.PlanarGraph
All known Subclasses: com.vividsolutions.jts.operation.polygonize.PolygonizeGraph, com.vividsolutions.jts.operation.linemerge.LineMergeGraph,
| PlanarGraph | | abstract public class PlanarGraph (Code) | | Represents a directed graph which is embeddable in a planar surface.
This class and the other classes in this package serve as a framework for
building planar graphs for specific algorithms. This class must be
subclassed to expose appropriate methods to construct the graph. This allows
controlling the types of graph components (
DirectedEdge s,
Edge s and
Node s) which can be added to the graph. An
application which uses the graph framework will almost always provide
subclasses for one or more graph components, which hold application-specific
data and graph algorithms.
version:
1.7 |
| Constructor Summary | |
| public | PlanarGraph()
Constructs a empty graph. |
| Method Summary | |
| protected void | add(Node node)
Adds a node to the map, replacing any that is already at that location. | | protected void | add(Edge edge)
Adds the Edge and its DirectedEdges with this PlanarGraph. | | protected void | add(DirectedEdge dirEdge)
Adds the Edge to this PlanarGraph; only subclasses can add DirectedEdges,
to ensure the edges added are of the right class. | | public boolean | contains(Edge e)
| | public boolean | contains(DirectedEdge de)
| | public Iterator | dirEdgeIterator()
Returns an Iterator over the DirectedEdges in this PlanarGraph, in the order in which they
were added. | | public Iterator | edgeIterator()
Returns an Iterator over the Edges in this PlanarGraph, in the order in which they
were added. | | public Node | findNode(Coordinate pt)
Returns the
Node at the given location,
or null if no
Node was there. | | public List | findNodesOfDegree(int degree)
Returns all Nodes with the given number of Edges around it. | | public Collection | getEdges()
| | public Collection | getNodes()
| | public Iterator | nodeIterator()
Returns an Iterator over the Nodes in this PlanarGraph. | | public void | remove(Edge edge)
Removes an
Edge and its associated
DirectedEdge s
from their from-Nodes and from the graph. | | public void | remove(DirectedEdge de)
Removes DirectedEdge from its from-Node and from this PlanarGraph. | | public void | remove(Node node)
Removes a node from the graph, along with any associated DirectedEdges and
Edges. |
| PlanarGraph | | public PlanarGraph()(Code) | | Constructs a empty graph.
|
| add | | protected void add(Node node)(Code) | | Adds a node to the map, replacing any that is already at that location.
Only subclasses can add Nodes, to ensure Nodes are of the right type.
the added node |
| add | | protected void add(Edge edge)(Code) | | Adds the Edge and its DirectedEdges with this PlanarGraph.
Assumes that the Edge has already been created with its associated DirectEdges.
Only subclasses can add Edges, to ensure the edges added are of the right class.
|
| add | | protected void add(DirectedEdge dirEdge)(Code) | | Adds the Edge to this PlanarGraph; only subclasses can add DirectedEdges,
to ensure the edges added are of the right class.
|
| contains | | public boolean contains(Edge e)(Code) | | Tests whether this graph contains the given
Edge
Parameters:
e - the edge to query true if the graph contains the edge |
| contains | | public boolean contains(DirectedEdge de)(Code) | | Tests whether this graph contains the given
DirectedEdge
Parameters:
de - the directed edge to query true if the graph contains the directed edge |
| edgeIterator | | public Iterator edgeIterator()(Code) | | Returns an Iterator over the Edges in this PlanarGraph, in the order in which they
were added.
See Also: PlanarGraph.add(Edge) |
| findNode | | public Node findNode(Coordinate pt)(Code) | | Returns the
Node at the given location,
or null if no
Node was there.
Parameters:
pt - the location to query the node found null if this graph contains no node at the location |
| findNodesOfDegree | | public List findNodesOfDegree(int degree)(Code) | | Returns all Nodes with the given number of Edges around it.
|
| nodeIterator | | public Iterator nodeIterator()(Code) | | Returns an Iterator over the Nodes in this PlanarGraph.
|
| remove | | public void remove(Edge edge)(Code) | | Removes an
Edge and its associated
DirectedEdge s
from their from-Nodes and from the graph.
Note: This method does not remove the
Node s associated
with the
Edge , even if the removal of the
Edge reduces the degree of a
Node to zero.
|
| remove | | public void remove(DirectedEdge de)(Code) | | Removes DirectedEdge from its from-Node and from this PlanarGraph.
This method does not remove the Nodes associated with the DirectedEdge,
even if the removal of the DirectedEdge reduces the degree of a Node to
zero.
|
| remove | | public void remove(Node node)(Code) | | Removes a node from the graph, along with any associated DirectedEdges and
Edges.
|
|
|