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

A

actionPerformed(ActionEvent) - Method in class lu.cs.co.graph.Viewer

anyElement() - Method in class lu.cs.co.util.Set

Removes an element from the set assuming it is nonempty.

B

Book - class lu.cs.co.graph.Book.

Constructors for undirected graphs based on a work of literature.

Book(String) - Constructor for class lu.cs.co.graph.Book

All encounters between characters in a given book.

Book(String, int) - Constructor for class lu.cs.co.graph.Book

Encounters between the most common characters in a given book.

Book(String, int, int) - Constructor for class lu.cs.co.graph.Book

Encounters between some of the more common characters in a given book.

Book(String, int, int, int, int, int, int, boolean, long) - Constructor for class lu.cs.co.graph.Book

General character-character or character-chapter relations in a given book.

C

clone() - Method in class lu.cs.co.graph.Forest

Returns a clone of this forest.

clone() - Method in class lu.cs.co.graph.Path

Returns a clone of this path.

clone() - Method in class lu.cs.co.graph.Edge

Returns a clone of this edge.

clone() - Method in class lu.cs.co.graph.Vertex

Returns a clone of this vertex.

clone() - Method in class lu.cs.co.graph.Marks

Returns a clone of this marking.

clone() - Method in class lu.cs.co.util.EquivalenceClasses

compareTo(Edge) - Method in class lu.cs.co.graph.Edge

Compares the length of two edges.

compareTo(Object) - Method in class lu.cs.co.graph.Edge

Compares this edge to another object.

compareTo(Object) - Method in class lu.cs.co.util.ObjectWithPriority

Compares this ObjectWithPriority to another object.

compareTo(ObjectWithPriority) - Method in class lu.cs.co.util.ObjectWithPriority

Compares this ObjectWithPriority to another object.

contains(Edge) - Method in class lu.cs.co.graph.Forest

Returns true iff a given edge is in the forest.

contains(Edge) - Method in class lu.cs.co.graph.Path

contains(Edge) - Method in interface lu.cs.co.graph.Subgraph

Returns true if and only if this subgraph contains a given edge.

contains(Edge) - Method in class lu.cs.co.graph.Marks

contains(Vertex) - Method in class lu.cs.co.graph.Forest

Always returns true.

contains(Vertex) - Method in class lu.cs.co.graph.Path

Check if the path contains a given vertex.

contains(Vertex) - Method in interface lu.cs.co.graph.Subgraph

Checks if this object contains the argument Vertex (which is supposed to be present in the underlying graph)

contains(Vertex) - Method in class lu.cs.co.graph.Marks

D

degree(Vertex) - Method in class lu.cs.co.graph.Forest

Returns the degree of a given vertex in this forest, that is, the number of incident forest edges.

degree(Vertex) - Method in class lu.cs.co.graph.Graph

The degree of a given vertex in an undirected graph.

deleteMin() - Method in class lu.cs.co.util.PriorityQueue

Removes the lowest priority element of the queue.

destroy() - Method in class lu.cs.co.graph.Viewer

Dijkstra - class lu.cs.co.demo.Dijkstra.

A class for shortest paths in graphs and digraphs.

Dijkstra(Graph, Vertex) - Constructor for class lu.cs.co.demo.Dijkstra

Dijkstra(Graph, Vertex, Vertex) - Constructor for class lu.cs.co.demo.Dijkstra

DirectedEdge - class lu.cs.co.graph.DirectedEdge.

A directed edge.

DirectedEdge(Vertex, Vertex) - Constructor for class lu.cs.co.graph.DirectedEdge

A directed edge of unit length between two vertices.

DirectedEdge(Vertex, Vertex, int) - Constructor for class lu.cs.co.graph.DirectedEdge

A directed edge between two vertices of given length.

dist(Vertex) - Method in class lu.cs.co.demo.Dijkstra

Find the distance to a vertex.

E

Edge - class lu.cs.co.graph.Edge.

This abstract class defines and provides fields and methods for an edge in a graph.

Edges - class lu.cs.co.graph.Edges.

An iterator over a set of edges.

edges() - Method in class lu.cs.co.graph.Forest

edges() - Method in class lu.cs.co.graph.Path

Creates an iterator over the edges on this path

edges() - Method in class lu.cs.co.graph.Marks

edges() - Method in class lu.cs.co.graph.Graph

Creates an iterator over the edges of this graph.

elements() - Method in class lu.cs.co.util.Set

Constructs and enumeration of the elements in the set.

emb(Vertex) - Method in class lu.cs.co.graph.Miles

emb(Vertex) - Method in interface lu.cs.co.graph.Embedding

Gets the plane coordinates of a given vertex.

Embedding - interface lu.cs.co.graph.Embedding.

Specifies an embedded graph (a graph whose vertices have fixed plane coordinates).

Embedding.Point - class lu.cs.co.graph.Embedding.Point.

EquivalenceClasses - class lu.cs.co.util.EquivalenceClasses.

Class for maintaining equivalence classes.

EquivalenceClasses(int) - Constructor for class lu.cs.co.util.EquivalenceClasses

Constructs n disjoint (singleton) classes.

exchange(int, int) - Method in class lu.cs.co.graph.Path

Exchange the two vertices on a closed path.

F

find(int) - Method in class lu.cs.co.util.EquivalenceClasses

Find a class given an element in it.

findByName(String) - Method in class lu.cs.co.graph.Graph

Deprecated. Use getVertex(String) instead.

findMin() - Method in class lu.cs.co.util.PriorityQueue

Return the lowest priority element in the queue.

findPath() - Method in class lu.cs.co.demo.Dijkstra

Find a shortest path from the source to the sink.

findPath(Vertex) - Method in class lu.cs.co.demo.Dijkstra

Find the shortest path from the source to a vertex.

flipMark(Vertex) - Method in class lu.cs.co.graph.Marks

Change the marking of a given vertex from marked to unmarked or vice versa.

Forest - class lu.cs.co.graph.Forest.

A class for (undirected) forests whose vertex set coincides with the underlying graph.

Forest(Graph) - Constructor for class lu.cs.co.graph.Forest

Constructs an empty forest over a given graph.

G

getAdjecencyMatrix() - Method in class lu.cs.co.graph.Graph

Compute this graph's adjecency matrix.

getBounds() - Method in class lu.cs.co.graph.Miles

getBounds() - Method in interface lu.cs.co.graph.Embedding

Gets the bounding box (as a rectangle) of this embedding.

getDistanceMatrix() - Method in class lu.cs.co.graph.Graph

Compute this graph's distance matrix.

getEdge(int) - Method in class lu.cs.co.graph.Path

Gets the edge with given index on this path.

getEdge(Vertex, Vertex) - Method in class lu.cs.co.graph.Graph

Get the edge joining two given vertices in this graph, assuming it exists.

getIndex(Vertex) - Method in class lu.cs.co.graph.Graph

Gets the index of a given vertex in the ordering of this graph's vertices.

getVertex(int) - Method in class lu.cs.co.graph.Path

Gets the vertex with given index on this path.

getVertex(int) - Method in class lu.cs.co.graph.Graph

Gets a vertex with a given index in the ordering of the vertices of this graph.

getVertex(String) - Method in class lu.cs.co.graph.Graph

Gets a vertex matching a given string.

Graph - class lu.cs.co.graph.Graph.

A class for combinatorial graphs.

Graph(Graph, boolean) - Constructor for class lu.cs.co.graph.Graph

Constructs a new Graph from a graph, possibly complementing it.

Graph(int, boolean) - Constructor for class lu.cs.co.graph.Graph

Construct a trivial (complete or empty) graph of given size.

Graph(Subgraph) - Constructor for class lu.cs.co.graph.Graph

The subgraph induced by a set of vertices.

H

hasEdge(Vertex, Vertex) - Method in class lu.cs.co.graph.Graph

Check if two given vertices are incident in this graph.

hasNext() - Method in class lu.cs.co.graph.Vertices

Returns true if there are any vertices left.

hasNext() - Method in class lu.cs.co.graph.Edges

Returns true if there are any edges left.

head() - Method in class lu.cs.co.graph.Path

The last vertex on this path.

I

incident(Vertex) - Method in class lu.cs.co.graph.Graph

Creates an iterator over the edges in this graph that are incident to a given vertex.

incoming(Vertex) - Method in class lu.cs.co.graph.Graph

Creates an iterator over the edges in this graph that are incoming to a given vertex.

indegree(Vertex) - Method in class lu.cs.co.graph.Graph

Returns the outdegree of a given vertex.

index(Vertex) - Method in class lu.cs.co.graph.Graph

Deprecated. Use getIndex instead

inducesCycle(Edge) - Method in class lu.cs.co.graph.Forest

Returns true iff inserting the given edge would induce a cycle in this forest.

insert(Comparable) - Method in class lu.cs.co.util.PriorityQueue

Insert an element into the queue.

insert(Edge) - Method in class lu.cs.co.graph.Forest

Inserts an edge.

insert(Edge) - Method in class lu.cs.co.graph.Path

Extends the path with a new edge.

insert(Object) - Method in class lu.cs.co.util.Set

Inserts a given element into the set.

isClosed() - Method in class lu.cs.co.graph.Path

Returns true iff this path is a cycle.

isDirected() - Method in class lu.cs.co.graph.Graph

Check if this graph is directed or not.

isEmpty() - Method in class lu.cs.co.util.PriorityQueue

Return true iff this queue is empty

isEmpty() - Method in class lu.cs.co.util.Set

isExtendedBy(Edge) - Method in class lu.cs.co.graph.Path

Checks if an edge can be added to the path.

isHamiltonian() - Method in class lu.cs.co.graph.Path

Check if the path is Hamiltonian, that is, it contains every vertex in the underlying graph precisely once.

isReachable() - Method in class lu.cs.co.demo.Dijkstra

isReachable(Vertex) - Method in class lu.cs.co.demo.Dijkstra

itemStateChanged(ItemEvent) - Method in class lu.cs.co.graph.Viewer

L

len - Variable in class lu.cs.co.graph.Forest

The total edge length/weigth of all edges in the forest.

len - Variable in class lu.cs.co.graph.Path

The total length of the path.

len - Variable in class lu.cs.co.graph.Edge

The edge's length.

lu.cs.co.demo - package lu.cs.co.demo

Demonstrates use of the classes in lu.cs.co.graph and lu.cs.co.util.

lu.cs.co.graph - package lu.cs.co.graph

Provides classes and interfaces for graphs, subgraphs, vertices, edges, paths, forests, etc.

lu.cs.co.util - package lu.cs.co.util

Provides some useful data structures like a priority queue, a set, and a union-find structure for equivalence classes.

M

m - Variable in class lu.cs.co.graph.Graph

The number of edges

main(String[]) - Static method in class lu.cs.co.graph.Viewer

The executable from of this class reads a graph description (parseable by the Graph.parseGraph method) from standard input at shows the graph.

main(String[]) - Static method in class lu.cs.co.graph.Graph

Construct a graph from standard input and write its description to standard output.

main(String[]) - Static method in class lu.cs.co.demo.Dijkstra

Throwaway demo method: read in a source, sink, and graph and print the shortest path.

mark(Vertex) - Method in class lu.cs.co.graph.Marks

Marks a given vertex.

Marks - class lu.cs.co.graph.Marks.

A class for marking vertices, which can be viewed as a class for subsets of the vertices of a graph.

Marks(Graph) - Constructor for class lu.cs.co.graph.Marks

Construct an (empty) marking in a given graph.

Miles - class lu.cs.co.graph.Miles.

Constructor for undirected graphs based on US mileage data.

Miles() - Constructor for class lu.cs.co.graph.Miles

The complete graph including all cities.

Miles(int) - Constructor for class lu.cs.co.graph.Miles

The complete graph on a specified number of large cities.

Miles(int, int) - Constructor for class lu.cs.co.graph.Miles

A graph on a specified number of cities and with sufficiently short edges.

Miles(int, int, int) - Constructor for class lu.cs.co.graph.Miles

A graph on a specified number of cities, with sufficiently short edges and low degree.

Miles(int, int, int, int, int, int, int) - Constructor for class lu.cs.co.graph.Miles

General constructor for intercity mileage graphs.

N

n - Variable in class lu.cs.co.graph.Graph

The number of vertices

name - Variable in class lu.cs.co.graph.Graph

The graph's name

neighbour(Vertex) - Method in class lu.cs.co.graph.Edge

The neighbour of a given vertex on this edge.

next() - Method in class lu.cs.co.graph.Vertices

Return the next vertex.

next() - Method in class lu.cs.co.graph.Edges

Returns the next edge.

NoSuchElementException - exception lu.cs.co.graph.NoSuchElementException.

NoSuchElementException() - Constructor for class lu.cs.co.graph.NoSuchElementException

Constructs a NoSuchElementException with no detail message.

NoSuchElementException(String) - Constructor for class lu.cs.co.graph.NoSuchElementException

Constructs a NoSuchElementException with the specified detail message.

numEdges() - Method in class lu.cs.co.graph.Forest

numEdges() - Method in class lu.cs.co.graph.Path

The number of edges on this path.

numEdges() - Method in interface lu.cs.co.graph.Subgraph

Returns the number of edges in this subgraph

numEdges() - Method in class lu.cs.co.graph.Marks

Always returns zero (edges cannot be marked).

numVertices() - Method in class lu.cs.co.graph.Forest

Returns the number of forest vertices, which is always the number of vertices in the underlying graph.

numVertices() - Method in class lu.cs.co.graph.Path

The number of vertices on this path.

numVertices() - Method in interface lu.cs.co.graph.Subgraph

Returns the number of vertices in this subgraph

numVertices() - Method in class lu.cs.co.graph.Marks

O

obj - Variable in class lu.cs.co.util.ObjectWithPriority

ObjectWithPriority - class lu.cs.co.util.ObjectWithPriority.

An object with a priority.

ObjectWithPriority(Object, int) - Constructor for class lu.cs.co.util.ObjectWithPriority

Constructs an tuple of a specified priority

outdegree(Vertex) - Method in class lu.cs.co.graph.Graph

The indegree of a given vertex.

outgoing(Vertex) - Method in class lu.cs.co.graph.Graph

Creates an iterator over the edges in this graph that are outgoing from a given vertex.

P

parseGraph(String[]) - Static method in class lu.cs.co.graph.Graph

The graph specified by an array of strings, useful for input from the command line in a uniform fashion.

Path - class lu.cs.co.graph.Path.

A class for simple paths in a graph.

Path(Graph) - Constructor for class lu.cs.co.graph.Path

Constructs an empty path.

Path(Graph, int[], boolean) - Constructor for class lu.cs.co.graph.Path

Constructs a path from an array of vertex indices.

Path(Graph, Vertex) - Constructor for class lu.cs.co.graph.Path

Constructs a path consisting of one vertex only.

Path(Graph, Vertices) - Constructor for class lu.cs.co.graph.Path

Constructs a path consisting of the given vertices.

prio - Variable in class lu.cs.co.util.ObjectWithPriority

PriorityQueue - class lu.cs.co.util.PriorityQueue.

A priority queue.

PriorityQueue() - Constructor for class lu.cs.co.util.PriorityQueue

Constructs an empty queue.

PriorityQueue(int) - Constructor for class lu.cs.co.util.PriorityQueue

Constructs an empty queue.

R

RandomGraph - class lu.cs.co.graph.RandomGraph.

Constructors for random graphs.

RandomGraph(Graph, int, int, long) - Constructor for class lu.cs.co.graph.RandomGraph

Construct a graph from a given graph by randomising its edge lengths.

RandomGraph(int, float, long) - Constructor for class lu.cs.co.graph.RandomGraph

A random undirected graph with a specified edge probability.

RandomGraph(int, int, boolean, boolean, boolean, long) - Constructor for class lu.cs.co.graph.RandomGraph

Constructs a random graph with a specified number of edges.

RandomGraph(int, int, long) - Constructor for class lu.cs.co.graph.RandomGraph

A random undirected graph with a specified number of edges.

reach(Graph, Vertex) - Static method in class lu.cs.co.graph.Marks

Construct a marking of the nodes in G that reach v.

reachable(Graph, Vertex, Vertex) - Static method in class lu.cs.co.graph.Marks

Checks if a speciefied vertex is reachable from another.

removeMarks() - Method in class lu.cs.co.graph.Marks

Remove all marks.

Roget - class lu.cs.co.graph.Roget.

Constructors for graphs based on Roget's Thesaurus.

Roget() - Constructor for class lu.cs.co.graph.Roget

The graph corresponding to all cross-references in Roget's Thesaurus.

Roget(int, int, int, long) - Constructor for class lu.cs.co.graph.Roget

A graph with a specified number of random categrories, and a random selection of edges that between categories that are sufficiently unrelated.

Roget(int, int, long) - Constructor for class lu.cs.co.graph.Roget

A graph with a specified number of random categories, and a random selection of edges.

Roget(int, long) - Constructor for class lu.cs.co.graph.Roget

A graph with a specified number of random categories.

S

Set - class lu.cs.co.util.Set.

A very simple class for sets.

Set() - Constructor for class lu.cs.co.util.Set

Constructs an empty set.

Set(int) - Constructor for class lu.cs.co.util.Set

Constructs an empty set.

setGraph(Graph) - Method in class lu.cs.co.graph.Viewer

Sets the graph of this view.

setSubgraph(Subgraph) - Method in class lu.cs.co.graph.Viewer

Sets the subgraph of this view.

size() - Method in class lu.cs.co.graph.Forest

Returns the number of edges in the forest.

size() - Method in class lu.cs.co.graph.Path

The number of vertices on this path.

size() - Method in class lu.cs.co.graph.Marks

Returns the number of marked vertices.

size() - Method in class lu.cs.co.util.PriorityQueue

Returns queue's size (number of elements).

size() - Method in class lu.cs.co.util.Set

Returns this set's cardinality (number of elements):

start() - Method in class lu.cs.co.graph.Viewer

stop() - Method in class lu.cs.co.graph.Viewer

StructureViolationException - exception lu.cs.co.graph.StructureViolationException.

StructureViolationException() - Constructor for class lu.cs.co.graph.StructureViolationException

Constructs a StructureViolationException with no detail message.

StructureViolationException(String) - Constructor for class lu.cs.co.graph.StructureViolationException

Constructs a StructureViolationException with the specified detail message.

Subgraph - interface lu.cs.co.graph.Subgraph.

Specifies common methods for subgraphs of a graph.

T

tail() - Method in class lu.cs.co.graph.Path

The first vertex on this path.

toss(Comparable) - Method in class lu.cs.co.util.PriorityQueue

Insert an element into the queue.

toString() - Method in class lu.cs.co.graph.Forest

Returns a textual representation of the forest.

toString() - Method in class lu.cs.co.graph.Path

toString() - Method in class lu.cs.co.graph.Edge

toString() - Method in class lu.cs.co.graph.DirectedEdge

toString() - Method in class lu.cs.co.graph.Vertex

toString() - Method in class lu.cs.co.graph.Marks

toString() - Method in class lu.cs.co.graph.Graph

Creates a string representation of this Graph.

toString() - Method in class lu.cs.co.graph.UndirectedEdge

U

u - Variable in class lu.cs.co.graph.Edge

The first vertex incident to the edge.

UnderflowException - exception lu.cs.co.util.UnderflowException.

Thrown for example, if an empty priority queue is asked for its smalles element.

UnderflowException() - Constructor for class lu.cs.co.util.UnderflowException

Constructs a new UnderflowException with no detail message.

underlying() - Method in class lu.cs.co.graph.Forest

underlying() - Method in class lu.cs.co.graph.Path

underlying() - Method in interface lu.cs.co.graph.Subgraph

Returns the underlying graph.

underlying() - Method in class lu.cs.co.graph.Marks

UndirectedEdge - class lu.cs.co.graph.UndirectedEdge.

An undirected edge.

UndirectedEdge(Vertex, Vertex) - Constructor for class lu.cs.co.graph.UndirectedEdge

An undirected edge of unit length between two vertices.

UndirectedEdge(Vertex, Vertex, int) - Constructor for class lu.cs.co.graph.UndirectedEdge

An undirected edge between two vertices of given length.

unite(int, int) - Method in class lu.cs.co.util.EquivalenceClasses

Identifies two classes.

unmark(Vertex) - Method in class lu.cs.co.graph.Marks

Removes the mark of a given vertex.

V

v - Variable in class lu.cs.co.graph.Edge

The second vertex incident to the edge.

Vertex - class lu.cs.co.graph.Vertex.

A vertex.

Vertices - class lu.cs.co.graph.Vertices.

An iterator over a set of vertices.

vertices() - Method in class lu.cs.co.graph.Forest

vertices() - Method in class lu.cs.co.graph.Path

Creates an iterator over the vertices on this path.

vertices() - Method in class lu.cs.co.graph.Marks

Constructs an iterator over the marked vertices.

vertices() - Method in class lu.cs.co.graph.Graph

Creates an iterator over the vertices of this graph.

Viewer - class lu.cs.co.graph.Viewer.

Viewer(Graph) - Constructor for class lu.cs.co.graph.Viewer

Constructs a view of a given graph.

Viewer(Subgraph) - Constructor for class lu.cs.co.graph.Viewer

Constructs a view of a given subgraph.

W

Words - class lu.cs.co.graph.Words.

Constructors for undirected graphs whose vertices are five-letter words.

Words(int) - Constructor for class lu.cs.co.graph.Words

A complete graph on a specified number of randomly chosen vertices.

Words(int, int, int, boolean, boolean, boolean, boolean, long) - Constructor for class lu.cs.co.graph.Words

A graph on a specified number of randomly chosen vertices.

Words(int, int, int, long) - Constructor for class lu.cs.co.graph.Words

A graph on a specified number of randomly chosen vertices; edges are included if their Hamming and character distances do not exceed the given thresholds.

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