A C D E F G H I L M N O P Q R S T U V

A

add(T) - Method in class edu.uci.ics.dillenco.datastruct.UnionFind

Add the given data item as a singleton set.

addEdge(Node, Node) - Method in class edu.uci.ics.dillenco.simplegraph01.Graph

Create a new edge and add it to this graph.

addLast(T) - Method in class edu.uci.ics.dillenco.datastruct.CircList

addNode() - Method in class edu.uci.ics.dillenco.simplegraph01.Graph

Create a new node and add it to this graph.

C

charName(Graph) - Method in class edu.uci.ics.dillenco.simplegraph01.HalfEdge

charName() - Method in class edu.uci.ics.dillenco.simplegraph01.Node

charName(Graph) - Method in class edu.uci.ics.dillenco.simplegraph01.QEdge

CircList<T> - Class in edu.uci.ics.dillenco.datastruct

This class represents a hybrid circular/linked list.

CircList() - Constructor for class edu.uci.ics.dillenco.datastruct.CircList

CircList.Element<T> - Class in edu.uci.ics.dillenco.datastruct

clear() - Method in class edu.uci.ics.dillenco.simplegraph01.HalfEdgeMap

Remove all stored values in this map

clear() - Method in class edu.uci.ics.dillenco.simplegraph01.NodeMap

Remove all stored values in this map

clear() - Method in class edu.uci.ics.dillenco.simplegraph01.QEdgeMap

Remove all stored values in this map

close() - Method in class edu.uci.ics.dillenco.datastruct.CircList

D

DEFAULT_MAP_HALFEDGE_MAX - Static variable in class edu.uci.ics.dillenco.simplegraph01.GraphParms

Default value for the maximum number of half edge maps plus single edge maps that can be active at one.

DEFAULT_MAP_NODE_MAX - Static variable in class edu.uci.ics.dillenco.simplegraph01.GraphParms

Default value for the maximum number of node maps that can be active at one.

DEFAULT_MAP_QEDGE_MAX - Static variable in class edu.uci.ics.dillenco.simplegraph01.GraphParms

Default value for the maximum number of qEdge maps that can be active at one.

dump(String) - Method in class edu.uci.ics.dillenco.simplegraph01.Graph

Prints a dump of the graph with specified identifying label string on the standard output.

dump() - Method in class edu.uci.ics.dillenco.simplegraph01.Graph

Prints a dump of the graph on the standard output

dump(PrintStream) - Method in class edu.uci.ics.dillenco.simplegraph01.Graph

Prints a dump of the graph on the specified print stream.

dump(String, PrintStream) - Method in class edu.uci.ics.dillenco.simplegraph01.Graph

Prints a dump of the graph with specified identifying label string on the specified print stream.

E

edu.uci.ics.dillenco.datastruct - package edu.uci.ics.dillenco.datastruct

edu.uci.ics.dillenco.graphalg - package edu.uci.ics.dillenco.graphalg

edu.uci.ics.dillenco.simplegraph01 - package edu.uci.ics.dillenco.simplegraph01

edu.uci.ics.dillenco.util - package edu.uci.ics.dillenco.util

extractPrefix(T) - Method in class edu.uci.ics.dillenco.datastruct.CircList

F

find(T) - Method in class edu.uci.ics.dillenco.datastruct.UnionFind

Return the label of the set containing the given data item.

flipOp() - Method in class edu.uci.ics.dillenco.simplegraph01.HalfEdge

Apply the flip operation to this this HalfEdge.

G

get(HalfEdge) - Method in class edu.uci.ics.dillenco.simplegraph01.HalfEdgeMap

Retrieve the value associated with the given HalfEdge.

get(QEdge, int) - Method in class edu.uci.ics.dillenco.simplegraph01.HalfEdgeMap

Retrieve the value associated with the given HalfEdge.

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.

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.

getEdgeCount() - Method in class edu.uci.ics.dillenco.simplegraph01.Graph

Return the number of edges 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 e₀Rot^r.

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 e₀Rot^r, 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.

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 e₀Rot^r.

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 e₀Rot^r.

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.

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.

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 e₀Rot^r, 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).

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

H

HalfEdge - Class in edu.uci.ics.dillenco.simplegraph01

A 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)

HalfEdge(QEdge, int, int) - Constructor for class edu.uci.ics.dillenco.simplegraph01.HalfEdge

Constructs a HalfEdge from the given QEdge, rotation, and flip coefficients.

HalfEdge(QEdge, int) - Constructor for class edu.uci.ics.dillenco.simplegraph01.HalfEdge

Constructs a HalfEdge from the given QEdge and rotation coefficients.

HalfEdge(HalfEdge) - Constructor for class edu.uci.ics.dillenco.simplegraph01.HalfEdge

Constructs a HalfEdge, taking its QEdge, rotation, and flip coefficients from the input parameter.

HalfEdge(QEdge, int, Node, boolean) - Constructor for class edu.uci.ics.dillenco.simplegraph01.HalfEdge

Constructs a HalfEdge from the given QEdge and flip coefficient with prescribed origin or neighbor Node.

HalfEdge(QEdge, Node, boolean) - Constructor for class edu.uci.ics.dillenco.simplegraph01.HalfEdge

Constructs a HalfEdge from the given QEdge with prescribed origin or neighbor Node.

HalfEdge(QEdge, int, Node) - Constructor for class edu.uci.ics.dillenco.simplegraph01.HalfEdge

Constructs a HalfEdge from the given QEdge and flip coefficient with prescribed origin Node.

HalfEdge(QEdge, Node) - Constructor for class edu.uci.ics.dillenco.simplegraph01.HalfEdge

Constructs a HalfEdge from the given QEdge with prescribed origin Node.

HalfEdgeMap<V> - Class in edu.uci.ics.dillenco.simplegraph01

This class maps HalfEdges of a given graph to user-defined attributes.

HalfEdgeMap(Graph) - Constructor for class edu.uci.ics.dillenco.simplegraph01.HalfEdgeMap

Create an empty QEdgeMap for the given graph.

I

inputGraph() - Method in class edu.uci.ics.dillenco.simplegraph01.GraphIO

isAlmostPerfect() - Method in class edu.uci.ics.dillenco.graphalg.Matching

Return true if this matching is almost perfect.

isDegSeqRequired() - Method in enum edu.uci.ics.dillenco.simplegraph01.GraphFormat

isDirected() - Method in class edu.uci.ics.dillenco.simplegraph01.HalfEdge

Return whether this HalfEdge is a directed edge.

isDirected(int) - Method in class edu.uci.ics.dillenco.simplegraph01.QEdge

Return whether the half-edge e₀Rot^r.

isEmpty() - Method in class edu.uci.ics.dillenco.simplegraph01.HalfEdgeMap

isEmpty() - Method in class edu.uci.ics.dillenco.simplegraph01.NodeMap

isEmpty() - Method in class edu.uci.ics.dillenco.simplegraph01.QEdgeMap

isHead() - Method in class edu.uci.ics.dillenco.simplegraph01.HalfEdge

Return whether the origin of this half edge is the head of the edge to which it belongs (i.e., whether this edge is directed toward the origin of this half-edge).

isHead(int) - Method in class edu.uci.ics.dillenco.simplegraph01.QEdge

Return whether the origin of the half-edge e₀Rot^r is the head of the edge containing this half-edge (i.e., whether this edge is directed toward the origin of the half-edge).

isOpen() - Method in class edu.uci.ics.dillenco.datastruct.CircList

isPerfect() - Method in class edu.uci.ics.dillenco.graphalg.Matching

Return true if this matching is perfect.

isTail() - Method in class edu.uci.ics.dillenco.simplegraph01.HalfEdge

Return whether the origin of this half edge is the tail of the edge to which it belongs (i.e., whether this edge is directed away from the origin of this half-edge).

isTail(int) - Method in class edu.uci.ics.dillenco.simplegraph01.QEdge

Return whether the origin of the half-edge e₀Rot^r is the tail of the edge containing this half-edge (i.e., whether this edge is directed away from the origin of the half-edge).

L

link(QEdge, Node) - Method in class edu.uci.ics.dillenco.simplegraph01.Graph

Link the specified edge into the rotation system at the indicated node.

link(QEdge) - Method in class edu.uci.ics.dillenco.simplegraph01.Node

Link the specified edge into the rotation system at this node.

logFine(String, Object...) - Method in class edu.uci.ics.dillenco.util.MinLogger

logFiner(String, Object...) - Method in class edu.uci.ics.dillenco.util.MinLogger

loggingAt(Level) - Method in class edu.uci.ics.dillenco.util.MinLogger

lookup(String) - Static method in enum edu.uci.ics.dillenco.simplegraph01.GraphFormat

M

Matching - Class in edu.uci.ics.dillenco.graphalg

Matching(Graph) - Constructor for class edu.uci.ics.dillenco.graphalg.Matching

Construct a matching for the given graph.

merge(T, T) - Method in class edu.uci.ics.dillenco.datastruct.UnionFind

Merge the sets containing the two given data items.

MinLogger - Class in edu.uci.ics.dillenco.util

This class provides a minimal logger

MinLogger(Level) - Constructor for class edu.uci.ics.dillenco.util.MinLogger

MinLogger() - Constructor for class edu.uci.ics.dillenco.util.MinLogger

N

Node - Class in edu.uci.ics.dillenco.simplegraph01

NodeMap<V> - Class in edu.uci.ics.dillenco.simplegraph01

This class maps Nodes of a given graph to user-defined attributes.

NodeMap(Graph) - Constructor for class edu.uci.ics.dillenco.simplegraph01.NodeMap

Create an empty NodeMap for the given graph.

O

open() - Method in class edu.uci.ics.dillenco.datastruct.CircList

outputGraph(Graph, int) - Method in class edu.uci.ics.dillenco.simplegraph01.GraphIO

P

Panic - Class in edu.uci.ics.dillenco.util

Panic() - Constructor for class edu.uci.ics.dillenco.util.Panic

panic(String, Object...) - Static method in class edu.uci.ics.dillenco.util.Panic

permID - Variable in class edu.uci.ics.dillenco.simplegraph01.Node

permID - Variable in class edu.uci.ics.dillenco.simplegraph01.QEdge

put(HalfEdge, V) - Method in class edu.uci.ics.dillenco.simplegraph01.HalfEdgeMap

Store a <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 as 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.

Q

QEdge - Class in edu.uci.ics.dillenco.simplegraph01

A QEdge represents a QuadEdge, in the sense of the Guibas-Stolfi quadedge structure.

QEdgeMap<V> - Class in edu.uci.ics.dillenco.simplegraph01

This class maps qEdges of a given graph to user-defined attributes.

QEdgeMap(Graph) - Constructor for class edu.uci.ics.dillenco.simplegraph01.QEdgeMap

Create an empty QEdgeMap for the given graph.

R

reset() - Method in class edu.uci.ics.dillenco.datastruct.UnionFind

Reset the structure so every element is in its own equivalent class.

reverse() - Method in class edu.uci.ics.dillenco.datastruct.CircList

rotateOp(int) - Method in class edu.uci.ics.dillenco.simplegraph01.HalfEdge

Apply the rotation (rot) operation to this this HalfEdge.

S

setAsLabel(T) - Method in class edu.uci.ics.dillenco.datastruct.UnionFind

Set the indicated data item as the label (root) of its equivalence class.

setInputFormat(GraphFormat) - Method in class edu.uci.ics.dillenco.simplegraph01.GraphIO

setMapHalfEdgeMax(int) - Static method in class edu.uci.ics.dillenco.simplegraph01.GraphParms

Set the maximum number of half edge maps plus single edge maps per graph that can be active at once.

setMapNodeMax(int) - Static method in class edu.uci.ics.dillenco.simplegraph01.GraphParms

Set the maximum number of Node maps per graph that can be active at once.

setMapQEdgeMax(int) - Static method in class edu.uci.ics.dillenco.simplegraph01.GraphParms

Set the maximum number of QEdge maps per graph/dual pair that can be active at once.

setOutputFormat(GraphFormat) - Method in class edu.uci.ics.dillenco.simplegraph01.GraphIO

symOp() - Method in class edu.uci.ics.dillenco.simplegraph01.HalfEdge

Apply the sym operation to this this HalfEdge.

T

toString() - Method in class edu.uci.ics.dillenco.graphalg.Matching

Returns a string representation of the matching.

toString() - Method in class edu.uci.ics.dillenco.simplegraph01.HalfEdge

toString() - Method in class edu.uci.ics.dillenco.simplegraph01.Node

toString() - Method in class edu.uci.ics.dillenco.simplegraph01.QEdge

U

UnionFind<T> - Class in edu.uci.ics.dillenco.datastruct

This class implements the standard union-find algorithm, with weight balancing and path compression

UnionFind() - Constructor for class edu.uci.ics.dillenco.datastruct.UnionFind

Construct an empty union-find structure with an expected capacity of 100.

UnionFind(int) - Constructor for class edu.uci.ics.dillenco.datastruct.UnionFind

Construct an empty union-find structure with the given expected capacity.

V

valueOf(String) - Static method in enum edu.uci.ics.dillenco.simplegraph01.GraphFormat

Returns the enum constant of this type with the specified name.

values() - Static method in enum edu.uci.ics.dillenco.simplegraph01.GraphFormat

Returns an array containing the constants of this enum type, in the order they are declared.

verify() - Method in class edu.uci.ics.dillenco.datastruct.UnionFind

Verify internal consistency of data structures.

A C D E F G H I L M N O P Q R S T U V