public class Subgraph
extends java.lang.Object
PlanarGraph
.
A subgraph may contain any subset of Edge
s
from the parent graph.
It will also automatically contain all DirectedEdge
s
and Node
s associated with those edges.
No new objects are created when edges are added -
all associated components must already exist in the parent graph.Modifier and Type | Field and Description |
---|---|
protected java.util.List |
dirEdges |
protected java.util.Set |
edges |
protected NodeMap |
nodeMap |
protected PlanarGraph |
parentGraph |
Constructor and Description |
---|
Subgraph(PlanarGraph parentGraph)
Creates a new subgraph of the given
PlanarGraph |
Modifier and Type | Method and Description |
---|---|
void |
add(Edge e)
Adds an
Edge to the subgraph. |
boolean |
contains(Edge e)
Tests whether an
Edge is contained in this subgraph |
java.util.Iterator |
dirEdgeIterator()
Returns an
Iterator over the DirectedEdge s in this graph,
in the order in which they were added. |
java.util.Iterator |
edgeIterator()
Returns an
Iterator over the Edge s in this graph,
in the order in which they were added. |
PlanarGraph |
getParent()
Gets the
PlanarGraph which this subgraph
is part of. |
java.util.Iterator |
nodeIterator()
Returns an
Iterator over the Node s in this graph. |
protected PlanarGraph parentGraph
protected java.util.Set edges
protected java.util.List dirEdges
protected NodeMap nodeMap
public Subgraph(PlanarGraph parentGraph)
PlanarGraph
parentGraph
- the parent graphpublic PlanarGraph getParent()
PlanarGraph
which this subgraph
is part of.public void add(Edge e)
e
- the edge to addpublic java.util.Iterator dirEdgeIterator()
Iterator
over the DirectedEdge
s in this graph,
in the order in which they were added.add(Edge)
public java.util.Iterator edgeIterator()
Iterator
over the Edge
s in this graph,
in the order in which they were added.add(Edge)
public java.util.Iterator nodeIterator()
Iterator
over the Node
s in this graph.