|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||
<QEdge,rot> pair.
- get(Node) -
Method in class edu.uci.ics.dillenco.simplegraph01.NodeMap
- Retrieve the value associated with the given Node.
- get(QEdge) -
Method in class edu.uci.ics.dillenco.simplegraph01.QEdgeMap
- Retrieve the value associated with the given QEdge.
- get(HalfEdge) -
Method in class edu.uci.ics.dillenco.simplegraph01.QEdgeMap
- Retrieve the value associated with the QEdge to which the given HalfEdge
belongs.
- getByte() -
Method in class edu.uci.ics.dillenco.simplegraph01.InputDecoderBinary
-
- getDegree() -
Method in class edu.uci.ics.dillenco.simplegraph01.Node
- Return the number of edges incident on this node.
- getDirectedEdges() -
Method in class edu.uci.ics.dillenco.simplegraph01.Graph
- Returns an Iterable with an iterator that runs through all directed
edges of this graph,
ignoring undirected edges.
- getDirectedEdges(boolean) -
Method in class edu.uci.ics.dillenco.simplegraph01.Graph
- Returns an Iterable with an iterator that runs through all directed
edges of this graph.
- getDual() -
Method in class edu.uci.ics.dillenco.simplegraph01.Graph
- Return the dual of this graph, if one has been computed.
- getDualFlag() -
Method in class edu.uci.ics.dillenco.simplegraph01.Graph
- Return a flag indicating whether this is a "primal"
or "dual" graph.
- getEdgeCount() -
Method in class edu.uci.ics.dillenco.simplegraph01.Graph
- Return the number of edges in this graph.
- getFirstHalfEdge() -
Method in class edu.uci.ics.dillenco.simplegraph01.Graph
- Return the first halfEdge in this graph.
- getFlip() -
Method in class edu.uci.ics.dillenco.simplegraph01.HalfEdge
- Get the flip coefficient associated with this HalfEdge.
- getHalfEdge(int) -
Method in class edu.uci.ics.dillenco.simplegraph01.QEdge
- Return a HalfEdge representing the the half-edge
e0Rotr.
- getHalfEdges(boolean) -
Method in class edu.uci.ics.dillenco.simplegraph01.Graph
- Returns an Iterable with an iterator that runs through all HalfEdges
of this graph.
- getHalfEdges() -
Method in class edu.uci.ics.dillenco.simplegraph01.Node
- Returns an iterable with an iterator that runs through all
HalfEdges having this
node as origin, in positive order about this node.
- getHalfEdges(HalfEdge) -
Method in class edu.uci.ics.dillenco.simplegraph01.Node
- Returns an iterable with an iterator that runs through all
HalfEdges having this
node as origin, in positive order about this node, and with a specified
starting edge.
- getHead() -
Method in class edu.uci.ics.dillenco.datastruct.CircList
-
- getHead() -
Method in class edu.uci.ics.dillenco.simplegraph01.HalfEdge
- Return the head of this HalfEdge, which must be a directed edge.
- getHead(int) -
Method in class edu.uci.ics.dillenco.simplegraph01.QEdge
- Return the the head of the half-edge
e0Rotr,
which must be part of a directed edge.
- getID() -
Method in class edu.uci.ics.dillenco.simplegraph01.Graph
- Returns the id associated with this graph.
- getInHalfEdges() -
Method in class edu.uci.ics.dillenco.simplegraph01.Node
- Returns an iterable with an iterator that runs through all HalfEdges that
have this node as origin and are directed toward this node.
- getInputDecoder(GraphFormat) -
Static method in enum edu.uci.ics.dillenco.simplegraph01.GraphFormat
-
- getLine() -
Method in class edu.uci.ics.dillenco.simplegraph01.InputDecoderAscii
-
- getMapHalfEdgeMax() -
Static method in class edu.uci.ics.dillenco.simplegraph01.GraphParms
- Return the maximum number of HalfEdge maps per graph that can be
active at once.
- getMapNodeMax() -
Static method in class edu.uci.ics.dillenco.simplegraph01.GraphParms
- Return the maximum number of Node maps per graph that can be active
at once.
- getMapQEdgeMax() -
Static method in class edu.uci.ics.dillenco.simplegraph01.GraphParms
- Return the maximum number of QEdge maps per graph/dual pair
that can be active at once.
- getMaxNodes() -
Method in enum edu.uci.ics.dillenco.simplegraph01.GraphFormat
- This method returns the maximum number allowable nodes in a graph
encoded using this format.
- getNeighbor() -
Method in class edu.uci.ics.dillenco.simplegraph01.HalfEdge
- Get the neighbor node of this HalfEdge.
- getNeighbors() -
Method in class edu.uci.ics.dillenco.simplegraph01.Node
- Returns an iterable with an iterator that runs through all
neighbors of this node.
- getNeighbors(HalfEdge) -
Method in class edu.uci.ics.dillenco.simplegraph01.Node
- Returns an iterable with an iterator that runs through all
neighbors of this node, with a specified starting edge.
- getNext(int) -
Method in class edu.uci.ics.dillenco.simplegraph01.QEdge
- Return a HalfEdge representing the next half edge having the same
origin node as the HalfEdge e0Rotr.
- getNextEdgePermID() -
Method in class edu.uci.ics.dillenco.simplegraph01.Graph
- Get the next available node edge ID value and increment the seed.
- getNextNodePermID() -
Method in class edu.uci.ics.dillenco.simplegraph01.Graph
- Get the next available node permanent ID value and increment the seed.
- getNextNodeSeqID() -
Method in class edu.uci.ics.dillenco.simplegraph01.Graph
- Get the next available node sequential ID value and increment the seed.
- getNextQEdge() -
Method in class edu.uci.ics.dillenco.simplegraph01.QEdge
-
- getNodeCount() -
Method in class edu.uci.ics.dillenco.simplegraph01.Graph
- Return the number of nodes in this graph.
- getNodes() -
Method in class edu.uci.ics.dillenco.simplegraph01.Graph
- Returns an Iterable with an iterator that runs through all Nodes
of this graph.
- getONext() -
Method in class edu.uci.ics.dillenco.simplegraph01.HalfEdge
- Return the next HalfEdge with the same origin as this one.
- getOppNode(Node) -
Method in class edu.uci.ics.dillenco.simplegraph01.QEdge
- Returns the node opposite v along this QEdge.
- getOPrev() -
Method in class edu.uci.ics.dillenco.simplegraph01.HalfEdge
- Return the previous HalfEdge with the same origin as this one.
- getOrigin() -
Method in class edu.uci.ics.dillenco.simplegraph01.HalfEdge
- Get the origin node of this HalfEdge.
- getOrigin(int) -
Method in class edu.uci.ics.dillenco.simplegraph01.QEdge
- Return the origin node of the HalfEdge e0Rotr.
- getOutHalfEdges() -
Method in class edu.uci.ics.dillenco.simplegraph01.Node
- Return an iterable with an iterator that runs through all HalfEdges
that have this
node as origin and are directed away from this node.
- getOutputEncoder(GraphFormat) -
Static method in enum edu.uci.ics.dillenco.simplegraph01.GraphFormat
-
- getPermID() -
Method in class edu.uci.ics.dillenco.simplegraph01.Node
- Return the permanent ID of this node.
- getQEdge() -
Method in class edu.uci.ics.dillenco.simplegraph01.HalfEdge
- Get the Qedge associated with this HalfEdge.
- getQEdges() -
Method in class edu.uci.ics.dillenco.simplegraph01.Graph
- Returns an Iterable with an iterator that runs through all QEdges
of this graph.
- getRot() -
Method in class edu.uci.ics.dillenco.simplegraph01.HalfEdge
- Get the rotation coefficient associated with this HalfEdge.
- getRotationIndex(Node) -
Method in class edu.uci.ics.dillenco.simplegraph01.QEdge
- Returns the rotation index of node v.
- getSeqID() -
Method in class edu.uci.ics.dillenco.simplegraph01.Node
- Return the sequential ID of this node.
- getSize() -
Method in class edu.uci.ics.dillenco.graphalg.Matching
- Returns the size of the matching.
- getSym() -
Method in class edu.uci.ics.dillenco.simplegraph01.HalfEdge
- Return the HalfEdge symmetric to this halfEdge.
- getTail() -
Method in class edu.uci.ics.dillenco.datastruct.CircList
-
- getTail() -
Method in class edu.uci.ics.dillenco.simplegraph01.HalfEdge
- Return the tail of this HalfEdge, which must be a directed edge.
- getTail(int) -
Method in class edu.uci.ics.dillenco.simplegraph01.QEdge
- Return the the tail of the half-edge
e0Rotr,
which must be part of a directed edge.
- Graph - Class in edu.uci.ics.dillenco.simplegraph01
- A
Graph object represents a graph. - Graph() -
Constructor for class edu.uci.ics.dillenco.simplegraph01.Graph
- Constructs an empty graph (without vertices or edges).
- Graph(int, int) -
Constructor for class edu.uci.ics.dillenco.simplegraph01.Graph
- Constructs an empty graph (without vertices or edges).
- Graph(int, int, boolean) -
Constructor for class edu.uci.ics.dillenco.simplegraph01.Graph
- Constructs an empty graph (without vertices or edges).
- graph -
Variable in class edu.uci.ics.dillenco.simplegraph01.SimpleMap
-
- GraphCheckException - Exception in edu.uci.ics.dillenco.simplegraph01
-
- GraphCheckException(String) -
Constructor for exception edu.uci.ics.dillenco.simplegraph01.GraphCheckException
-
- GraphCheckException() -
Constructor for exception edu.uci.ics.dillenco.simplegraph01.GraphCheckException
-
- GraphFormat - Enum in edu.uci.ics.dillenco.simplegraph01
-
- GraphIO - Class in edu.uci.ics.dillenco.simplegraph01
-
- GraphIO() -
Constructor for class edu.uci.ics.dillenco.simplegraph01.GraphIO
-
- GraphIOException - Exception in edu.uci.ics.dillenco.simplegraph01
-
- GraphIOException(String) -
Constructor for exception edu.uci.ics.dillenco.simplegraph01.GraphIOException
-
- GraphIOException() -
Constructor for exception edu.uci.ics.dillenco.simplegraph01.GraphIOException
-
- GraphParms - Class in edu.uci.ics.dillenco.simplegraph01
-
- GraphParms() -
Constructor for class edu.uci.ics.dillenco.simplegraph01.GraphParms
-
HalfEdge object represents a half-edge, which consists
of a QEdge (in the sense of the Guibas-Stolfi quadedge structure),
a rotation (0 thru 3), and a flip coefficient (0 or 1)ShortHalfEdge object represents a partial half edge, just
the QEdge and the rot coefficient.<HalfEdge,V> pair.
- put(QEdge, int, V) -
Method in class edu.uci.ics.dillenco.simplegraph01.HalfEdgeMap
- Store a
<HalfEdge,V> pair, where the HalfEdge is specified
by a <QEdge,rot> pair.
- put(Node, V) -
Method in class edu.uci.ics.dillenco.simplegraph01.NodeMap
- Store a
<Node,V> pair.
- put(QEdge, V) -
Method in class edu.uci.ics.dillenco.simplegraph01.QEdgeMap
- Store a
<QEdge,V> pair.
QEdge represents a QuadEdge,
in the sense of the Guibas-Stolfi quadedge structure.
|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||