A C D E F G H I O P R S T U V

A

AbstractGraph<V,E> - Class in edu.uci.ics.jung.graph

Abstract implementation of the Graph interface.

AbstractGraph() - Constructor for class edu.uci.ics.jung.graph.AbstractGraph

AbstractTypedGraph<V,E> - Class in edu.uci.ics.jung.graph

An abstract class for graphs whose edges all have the same EdgeType.

AbstractTypedGraph(EdgeType) - Constructor for class edu.uci.ics.jung.graph.AbstractTypedGraph

Creates an instance with the specified edge type.

addChild(E, V, V, EdgeType) - Method in class edu.uci.ics.jung.graph.DelegateTree

add the passed child node as a child of parent.

addChild(E, V, V) - Method in class edu.uci.ics.jung.graph.DelegateTree

add the passed child node as a child of parent.

addEdge(E, Collection<? extends V>) - Method in class edu.uci.ics.jung.graph.AbstractGraph

addEdge(E, Collection<? extends V>, EdgeType) - Method in class edu.uci.ics.jung.graph.AbstractGraph

addEdge(E, V, V) - Method in class edu.uci.ics.jung.graph.AbstractGraph

addEdge(E, V, V, EdgeType) - Method in class edu.uci.ics.jung.graph.AbstractGraph

addEdge(E, Pair<? extends V>) - Method in class edu.uci.ics.jung.graph.AbstractGraph

Adds edge to this graph with the specified endpoints, with the default edge type.

addEdge(E, Pair<? extends V>, EdgeType) - Method in class edu.uci.ics.jung.graph.AbstractGraph

Adds edge to this graph with the specified endpoints and EdgeType.

addEdge(E, V, V, EdgeType) - Method in class edu.uci.ics.jung.graph.DelegateForest

Add an edge to the tree, connecting v1, the parent and v2, the child.

addEdge(E, Collection<? extends V>) - Method in class edu.uci.ics.jung.graph.DelegateForest

addEdge(E, V, V, EdgeType) - Method in class edu.uci.ics.jung.graph.DelegateTree

Add an edge to the tree, connecting v1, the parent and v2, the child.

addEdge(E, V, V) - Method in class edu.uci.ics.jung.graph.DelegateTree

Add an edge to the tree, connecting v1, the parent and v2, the child.

addEdge(E, Collection<? extends V>) - Method in class edu.uci.ics.jung.graph.DelegateTree

addEdge(E, Pair<? extends V>, EdgeType) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

addEdge(E, Pair<? extends V>, EdgeType) - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

addEdge(E, V, V, int) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

Adds the specified child vertex and edge e to the graph with the specified parent vertex parent.

addEdge(E, V, V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

addEdge(E, V, V, EdgeType) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

addEdge(E, Collection<? extends V>, EdgeType) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

addEdge(E, Pair<? extends V>, EdgeType) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

addEdge(H, Collection<? extends V>) - Method in class edu.uci.ics.jung.graph.SetHypergraph

Adds hyperedge to this graph and connects them to the vertex collection to_attach.

addEdge(H, Collection<? extends V>, EdgeType) - Method in class edu.uci.ics.jung.graph.SetHypergraph

addEdge(E, Pair<? extends V>, EdgeType) - Method in class edu.uci.ics.jung.graph.SparseGraph

addEdge(E, Pair<? extends V>, EdgeType) - Method in class edu.uci.ics.jung.graph.SparseMultigraph

addEdge(E, Pair<? extends V>, EdgeType) - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph

addEdge(E, V, V, EdgeType) - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

addEdge(E, Pair<? extends V>, EdgeType) - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

addTree(Tree<V, E>) - Method in class edu.uci.ics.jung.graph.DelegateForest

Adds tree to this graph as an element of this forest.

addVertex(V) - Method in class edu.uci.ics.jung.graph.DelegateForest

Add vertex as a root of the tree

addVertex(V) - Method in class edu.uci.ics.jung.graph.DelegateTree

Will set the root of the Tree, only if the Tree is empty and the root is currently unset.

addVertex(V) - Method in class edu.uci.ics.jung.graph.DirectedOrderedSparseMultigraph

addVertex(V) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

addVertex(V) - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

addVertex(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

addVertex(V) - Method in class edu.uci.ics.jung.graph.OrderedSparseMultigraph

addVertex(V) - Method in class edu.uci.ics.jung.graph.SetHypergraph

addVertex(V) - Method in class edu.uci.ics.jung.graph.SortedSparseMultigraph

addVertex(V) - Method in class edu.uci.ics.jung.graph.SparseGraph

addVertex(V) - Method in class edu.uci.ics.jung.graph.SparseMultigraph

addVertex(V) - Method in class edu.uci.ics.jung.graph.UndirectedOrderedSparseMultigraph

addVertex(V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph

addVertex(V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

C

containsEdge(E) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

containsEdge(E) - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

containsEdge(E) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

containsEdge(H) - Method in class edu.uci.ics.jung.graph.SetHypergraph

containsEdge(E) - Method in class edu.uci.ics.jung.graph.SparseGraph

containsEdge(E) - Method in class edu.uci.ics.jung.graph.SparseMultigraph

containsEdge(E) - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph

containsEdge(E) - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

containsVertex(V) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

containsVertex(V) - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

containsVertex(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

containsVertex(V) - Method in class edu.uci.ics.jung.graph.SetHypergraph

containsVertex(V) - Method in class edu.uci.ics.jung.graph.SparseGraph

containsVertex(V) - Method in class edu.uci.ics.jung.graph.SparseMultigraph

containsVertex(V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph

containsVertex(V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

createChainPlusIsolates(int, int) - Static method in class edu.uci.ics.jung.graph.util.TestGraphs

createDirectedAcyclicGraph(int, int, double) - Static method in class edu.uci.ics.jung.graph.util.TestGraphs

Creates a sample directed acyclic graph by generating several "layers", and connecting nodes (randomly) to nodes in earlier (but never later) layers.

createTestGraph(boolean) - Static method in class edu.uci.ics.jung.graph.util.TestGraphs

Creates a small sample graph that can be used for testing purposes.

D

degree(V) - Method in class edu.uci.ics.jung.graph.AbstractGraph

degree(V) - Method in class edu.uci.ics.jung.graph.SetHypergraph

DelegateForest<V,E> - Class in edu.uci.ics.jung.graph

An implementation of Forest that delegates to a specified DirectedGraph instance.

DelegateForest() - Constructor for class edu.uci.ics.jung.graph.DelegateForest

Creates an instance backed by a new DirectedSparseGraph instance.

DelegateForest(DirectedGraph<V, E>) - Constructor for class edu.uci.ics.jung.graph.DelegateForest

Creates an instance backed by the input DirectedGraph.

DelegateTree<V,E> - Class in edu.uci.ics.jung.graph

An implementation of Tree that delegates to a specified instance of DirectedGraph.

DelegateTree() - Constructor for class edu.uci.ics.jung.graph.DelegateTree

Creates an instance.

DelegateTree(Supplier<DirectedGraph<V, E>>) - Constructor for class edu.uci.ics.jung.graph.DelegateTree

create an instance with passed values.

DelegateTree(DirectedGraph<V, E>) - Constructor for class edu.uci.ics.jung.graph.DelegateTree

Creates a new DelegateTree which delegates to graph.

directed_edges - Variable in class edu.uci.ics.jung.graph.SparseGraph

directedEdges - Variable in class edu.uci.ics.jung.graph.SparseMultigraph

DirectedOrderedSparseMultigraph<V,E> - Class in edu.uci.ics.jung.graph

An implementation of DirectedGraph, suitable for sparse graphs, that orders its vertex and edge collections according to insertion time.

DirectedOrderedSparseMultigraph() - Constructor for class edu.uci.ics.jung.graph.DirectedOrderedSparseMultigraph

Creates a new instance.

DirectedSparseGraph<V,E> - Class in edu.uci.ics.jung.graph

An implementation of DirectedGraph suitable for sparse graphs.

DirectedSparseGraph() - Constructor for class edu.uci.ics.jung.graph.DirectedSparseGraph

Creates an instance.

DirectedSparseMultigraph<V,E> - Class in edu.uci.ics.jung.graph

An implementation of DirectedGraph, suitable for sparse graphs, that permits parallel edges.

DirectedSparseMultigraph() - Constructor for class edu.uci.ics.jung.graph.DirectedSparseMultigraph

Creates a new instance.

E

edge_comparator - Variable in class edu.uci.ics.jung.graph.SortedSparseMultigraph

Comparator used in ordering edges.

edge_type - Variable in class edu.uci.ics.jung.graph.AbstractTypedGraph

The edge type for all edges in this graph.

edge_vpairs - Variable in class edu.uci.ics.jung.graph.OrderedKAryTree

edges - Variable in class edu.uci.ics.jung.graph.DirectedSparseGraph

edges - Variable in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

edges - Variable in class edu.uci.ics.jung.graph.SetHypergraph

edges - Variable in class edu.uci.ics.jung.graph.SparseMultigraph

edges - Variable in class edu.uci.ics.jung.graph.UndirectedSparseGraph

edges - Variable in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

edu.uci.ics.jung.graph - package edu.uci.ics.jung.graph

edu.uci.ics.jung.graph.util - package edu.uci.ics.jung.graph.util

F

findEdge(V, V) - Method in class edu.uci.ics.jung.graph.AbstractGraph

findEdge(V, V) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

findEdge(V, V) - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

findEdge(V, V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

findEdge(V, V) - Method in class edu.uci.ics.jung.graph.SetHypergraph

findEdge(V, V) - Method in class edu.uci.ics.jung.graph.SparseGraph

findEdge(V, V) - Method in class edu.uci.ics.jung.graph.SparseMultigraph

findEdge(V, V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph

findEdge(V, V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

findEdgeSet(V, V) - Method in class edu.uci.ics.jung.graph.AbstractGraph

findEdgeSet(V, V) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

findEdgeSet(V, V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

findEdgeSet(V, V) - Method in class edu.uci.ics.jung.graph.SetHypergraph

findEdgeSet(V, V) - Method in class edu.uci.ics.jung.graph.SparseGraph

findEdgeSet(V, V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph

G

getChild(V, int) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

Returns the child of vertex at position index in this tree, or null if it has no child at that position.

getChildCount(V) - Method in class edu.uci.ics.jung.graph.DelegateForest

getChildCount(V) - Method in class edu.uci.ics.jung.graph.DelegateTree

get the number of children of the passed parent node

getChildCount(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getChildEdge(V, int) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getChildEdges(V) - Method in class edu.uci.ics.jung.graph.DelegateForest

getChildEdges(V) - Method in class edu.uci.ics.jung.graph.DelegateTree

getChildEdges(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getChildren(V) - Method in class edu.uci.ics.jung.graph.DelegateForest

getChildren(V) - Method in class edu.uci.ics.jung.graph.DelegateTree

get the immediate children nodes of the passed parent

getChildren(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

Returns an ordered list of vertex's child vertices.

getDefaultEdgeType() - Method in class edu.uci.ics.jung.graph.AbstractTypedGraph

Returns this graph's edge type.

getDefaultEdgeType() - Method in class edu.uci.ics.jung.graph.SetHypergraph

getDefaultEdgeType() - Method in class edu.uci.ics.jung.graph.SparseGraph

getDefaultEdgeType() - Method in class edu.uci.ics.jung.graph.SparseMultigraph

getDemoGraph() - Static method in class edu.uci.ics.jung.graph.util.TestGraphs

Returns a bigger test graph with a clique, several components, and other parts.

getDepth(V) - Method in class edu.uci.ics.jung.graph.DelegateForest

computes and returns the depth of the tree from the root to the passed vertex

getDepth(V) - Method in class edu.uci.ics.jung.graph.DelegateTree

computes and returns the depth of the tree from the root to the passed vertex

getDepth(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getDest(E) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

getDest(E) - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

getDest(E) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getDest(H) - Method in class edu.uci.ics.jung.graph.SetHypergraph

getDest(E) - Method in class edu.uci.ics.jung.graph.SparseGraph

getDest(E) - Method in class edu.uci.ics.jung.graph.SparseMultigraph

getDest(E) - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph

getDest(E) - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

getEdgeCount(EdgeType) - Method in class edu.uci.ics.jung.graph.AbstractTypedGraph

Returns the edge count for this graph if edge_type matches the edge type for this graph, and 0 otherwise.

getEdgeCount() - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

getEdgeCount() - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

getEdgeCount() - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getEdgeCount() - Method in class edu.uci.ics.jung.graph.SetHypergraph

getEdgeCount(EdgeType) - Method in class edu.uci.ics.jung.graph.SetHypergraph

getEdgeCount() - Method in class edu.uci.ics.jung.graph.SparseGraph

getEdgeCount(EdgeType) - Method in class edu.uci.ics.jung.graph.SparseGraph

getEdgeCount() - Method in class edu.uci.ics.jung.graph.SparseMultigraph

getEdgeCount(EdgeType) - Method in class edu.uci.ics.jung.graph.SparseMultigraph

getEdgeCount() - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph

getEdgeCount() - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

getEdges(EdgeType) - Method in class edu.uci.ics.jung.graph.AbstractTypedGraph

Returns the edge set for this graph if edgeType matches the edge type for this graph, and an empty set otherwise.

getEdges() - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

getEdges() - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

getEdges() - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getEdges() - Method in class edu.uci.ics.jung.graph.SetHypergraph

getEdges(EdgeType) - Method in class edu.uci.ics.jung.graph.SetHypergraph

getEdges(EdgeType) - Method in class edu.uci.ics.jung.graph.SparseGraph

getEdges() - Method in class edu.uci.ics.jung.graph.SparseGraph

getEdges() - Method in class edu.uci.ics.jung.graph.SparseMultigraph

getEdges(EdgeType) - Method in class edu.uci.ics.jung.graph.SparseMultigraph

getEdges() - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph

getEdges() - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

getEdgeType(E) - Method in class edu.uci.ics.jung.graph.AbstractTypedGraph

Returns this graph's edge type, or null if e is not in this graph.

getEdgeType(H) - Method in class edu.uci.ics.jung.graph.SetHypergraph

getEdgeType(E) - Method in class edu.uci.ics.jung.graph.SparseGraph

getEdgeType(E) - Method in class edu.uci.ics.jung.graph.SparseMultigraph

getEndpoints(E) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

getEndpoints(E) - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

getEndpoints(E) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getEndpoints(E) - Method in class edu.uci.ics.jung.graph.SparseGraph

getEndpoints(E) - Method in class edu.uci.ics.jung.graph.SparseMultigraph

getEndpoints(E) - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph

getEndpoints(E) - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

getFactory() - Static method in class edu.uci.ics.jung.graph.DelegateTree

getFactory() - Static method in class edu.uci.ics.jung.graph.DirectedOrderedSparseMultigraph

getFactory() - Static method in class edu.uci.ics.jung.graph.DirectedSparseGraph

getFactory() - Static method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

getFactory(int) - Static method in class edu.uci.ics.jung.graph.OrderedKAryTree

getFactory() - Static method in class edu.uci.ics.jung.graph.OrderedSparseMultigraph

getFactory() - Static method in class edu.uci.ics.jung.graph.SetHypergraph

Returns a Factory which creates instances of this class.

getFactory() - Static method in class edu.uci.ics.jung.graph.SortedSparseMultigraph

getFactory() - Static method in class edu.uci.ics.jung.graph.SparseGraph

getFactory() - Static method in class edu.uci.ics.jung.graph.SparseMultigraph

getFactory() - Static method in class edu.uci.ics.jung.graph.UndirectedOrderedSparseMultigraph

getFactory() - Static method in class edu.uci.ics.jung.graph.UndirectedSparseGraph

getFactory() - Static method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

getHeight() - Method in class edu.uci.ics.jung.graph.DelegateForest

computes and returns the height of the tree

getHeight() - Method in class edu.uci.ics.jung.graph.DelegateTree

Computes and returns the height of the tree.

getHeight() - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

Returns the height of the tree, or -1 if the tree is empty.

getIncident_internal(V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

getIncidentCount(E) - Method in class edu.uci.ics.jung.graph.AbstractGraph

getIncidentCount(E) - Method in class edu.uci.ics.jung.graph.DelegateForest

getIncidentCount(E) - Method in class edu.uci.ics.jung.graph.DelegateTree

getIncidentCount(E) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getIncidentCount(H) - Method in class edu.uci.ics.jung.graph.SetHypergraph

getIncidentEdges(V) - Method in class edu.uci.ics.jung.graph.DirectedOrderedSparseMultigraph

getIncidentEdges(V) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

getIncidentEdges(V) - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

getIncidentEdges(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getIncidentEdges(V) - Method in class edu.uci.ics.jung.graph.OrderedSparseMultigraph

getIncidentEdges(V) - Method in class edu.uci.ics.jung.graph.SetHypergraph

getIncidentEdges(V) - Method in class edu.uci.ics.jung.graph.SparseGraph

getIncidentEdges(V) - Method in class edu.uci.ics.jung.graph.SparseMultigraph

getIncidentEdges(V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph

getIncidentEdges(V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

getIncidentVertices(E) - Method in class edu.uci.ics.jung.graph.AbstractGraph

getIncidentVertices(E) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getIncidentVertices(H) - Method in class edu.uci.ics.jung.graph.SetHypergraph

getIncoming_internal(V) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

getIncoming_internal(V) - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

getIncoming_internal(V) - Method in class edu.uci.ics.jung.graph.SparseMultigraph

getInEdges(V) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

getInEdges(V) - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

getInEdges(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getInEdges(V) - Method in class edu.uci.ics.jung.graph.SetHypergraph

getInEdges(V) - Method in class edu.uci.ics.jung.graph.SparseGraph

getInEdges(V) - Method in class edu.uci.ics.jung.graph.SparseMultigraph

getInEdges(V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph

getInEdges(V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

getNeighborCount(V) - Method in class edu.uci.ics.jung.graph.AbstractGraph

getNeighborCount(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getNeighborCount(V) - Method in class edu.uci.ics.jung.graph.SetHypergraph

getNeighbors(V) - Method in class edu.uci.ics.jung.graph.DirectedOrderedSparseMultigraph

getNeighbors(V) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

getNeighbors(V) - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

getNeighbors(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getNeighbors(V) - Method in class edu.uci.ics.jung.graph.OrderedSparseMultigraph

getNeighbors(V) - Method in class edu.uci.ics.jung.graph.SetHypergraph

getNeighbors(V) - Method in class edu.uci.ics.jung.graph.SparseGraph

getNeighbors(V) - Method in class edu.uci.ics.jung.graph.SparseMultigraph

getNeighbors(V) - Method in class edu.uci.ics.jung.graph.UndirectedOrderedSparseMultigraph

getNeighbors(V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph

getNeighbors(V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

getOneComponentGraph() - Static method in class edu.uci.ics.jung.graph.util.TestGraphs

Returns a bigger, undirected test graph with a just one component.

getOpposite(V, E) - Method in class edu.uci.ics.jung.graph.AbstractGraph

getOpposite(V, E) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getOutEdges(V) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

getOutEdges(V) - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

getOutEdges(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getOutEdges(V) - Method in class edu.uci.ics.jung.graph.SetHypergraph

getOutEdges(V) - Method in class edu.uci.ics.jung.graph.SparseGraph

getOutEdges(V) - Method in class edu.uci.ics.jung.graph.SparseMultigraph

getOutEdges(V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph

getOutEdges(V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

getOutgoing_internal(V) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

getOutgoing_internal(V) - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

getOutgoing_internal(V) - Method in class edu.uci.ics.jung.graph.SparseMultigraph

getParent(V) - Method in class edu.uci.ics.jung.graph.DelegateForest

getParent(V) - Method in class edu.uci.ics.jung.graph.DelegateTree

get the single parent node of the passed child

getParent(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getParentEdge(V) - Method in class edu.uci.ics.jung.graph.DelegateForest

getParentEdge(V) - Method in class edu.uci.ics.jung.graph.DelegateTree

getParentEdge(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getPath(V) - Method in class edu.uci.ics.jung.graph.DelegateForest

returns an ordered list of the nodes beginning at the root and ending at the passed child node, including all intermediate nodes.

getPath(V) - Method in class edu.uci.ics.jung.graph.DelegateTree

Returns an ordered list of the nodes beginning at the root and ending at vertex, including all intermediate nodes.

getPredecessorCount(V) - Method in class edu.uci.ics.jung.graph.AbstractGraph

getPredecessorCount(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getPredecessors(V) - Method in class edu.uci.ics.jung.graph.DirectedOrderedSparseMultigraph

getPredecessors(V) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

getPredecessors(V) - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

getPredecessors(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getPredecessors(V) - Method in class edu.uci.ics.jung.graph.OrderedSparseMultigraph

getPredecessors(V) - Method in class edu.uci.ics.jung.graph.SetHypergraph

getPredecessors(V) - Method in class edu.uci.ics.jung.graph.SparseGraph

getPredecessors(V) - Method in class edu.uci.ics.jung.graph.SparseMultigraph

getPredecessors(V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph

getPredecessors(V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

getPreds_internal(V) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

getRoot() - Method in class edu.uci.ics.jung.graph.DelegateForest

getRoot() - Method in class edu.uci.ics.jung.graph.DelegateTree

getter for the root of the tree

getRoot() - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getRoots() - Method in class edu.uci.ics.jung.graph.DelegateForest

getSmallGraph() - Static method in class edu.uci.ics.jung.graph.util.TestGraphs

getSource(E) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

getSource(E) - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

getSource(E) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getSource(H) - Method in class edu.uci.ics.jung.graph.SetHypergraph

getSource(E) - Method in class edu.uci.ics.jung.graph.SparseGraph

getSource(E) - Method in class edu.uci.ics.jung.graph.SparseMultigraph

getSource(E) - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph

getSource(E) - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

getSuccessorCount(V) - Method in class edu.uci.ics.jung.graph.AbstractGraph

getSuccessorCount(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getSuccessors(V) - Method in class edu.uci.ics.jung.graph.DirectedOrderedSparseMultigraph

getSuccessors(V) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

getSuccessors(V) - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

getSuccessors(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getSuccessors(V) - Method in class edu.uci.ics.jung.graph.OrderedSparseMultigraph

getSuccessors(V) - Method in class edu.uci.ics.jung.graph.SetHypergraph

getSuccessors(V) - Method in class edu.uci.ics.jung.graph.SparseGraph

getSuccessors(V) - Method in class edu.uci.ics.jung.graph.SparseMultigraph

getSuccessors(V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph

getSuccessors(V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

getSuccs_internal(V) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

getTrees() - Method in class edu.uci.ics.jung.graph.DelegateForest

getTrees() - Method in class edu.uci.ics.jung.graph.DelegateTree

getTrees() - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getValidatedEndpoints(E, Pair<? extends V>) - Method in class edu.uci.ics.jung.graph.AbstractGraph

getVertexCount() - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

getVertexCount() - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

getVertexCount() - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getVertexCount() - Method in class edu.uci.ics.jung.graph.SetHypergraph

getVertexCount() - Method in class edu.uci.ics.jung.graph.SparseGraph

getVertexCount() - Method in class edu.uci.ics.jung.graph.SparseMultigraph

getVertexCount() - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph

getVertexCount() - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

getVertices() - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

getVertices() - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

getVertices() - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

getVertices() - Method in class edu.uci.ics.jung.graph.SetHypergraph

getVertices() - Method in class edu.uci.ics.jung.graph.SparseGraph

getVertices() - Method in class edu.uci.ics.jung.graph.SparseMultigraph

getVertices() - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph

getVertices() - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

H

hasEqualEdgeType(EdgeType) - Method in class edu.uci.ics.jung.graph.AbstractTypedGraph

height - Variable in class edu.uci.ics.jung.graph.OrderedKAryTree

I

INCIDENT - Static variable in class edu.uci.ics.jung.graph.SparseGraph

INCOMING - Static variable in class edu.uci.ics.jung.graph.SparseGraph

inDegree(V) - Method in class edu.uci.ics.jung.graph.AbstractGraph

inDegree(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

inDegree(V) - Method in class edu.uci.ics.jung.graph.SetHypergraph

isDest(V, E) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

isDest(V, E) - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

isDest(V, E) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

isDest(V, E) - Method in class edu.uci.ics.jung.graph.SparseGraph

isDest(V, E) - Method in class edu.uci.ics.jung.graph.SparseMultigraph

isDest(V, E) - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph

isDest(V, E) - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

isIncident(V, E) - Method in class edu.uci.ics.jung.graph.AbstractGraph

isIncident(V, E) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

isIncident(V, H) - Method in class edu.uci.ics.jung.graph.SetHypergraph

isInternal(V) - Method in class edu.uci.ics.jung.graph.DelegateForest

isInternal(V) - Method in class edu.uci.ics.jung.graph.DelegateTree

isLeaf(V) - Method in class edu.uci.ics.jung.graph.DelegateForest

isLeaf(V) - Method in class edu.uci.ics.jung.graph.DelegateTree

isLeaf(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

Returns true if vertex is a leaf of this tree, i.e., if it has no children.

isNeighbor(V, V) - Method in class edu.uci.ics.jung.graph.AbstractGraph

isNeighbor(V, V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

isNeighbor(V, V) - Method in class edu.uci.ics.jung.graph.SetHypergraph

isPredecessor(V, V) - Method in class edu.uci.ics.jung.graph.AbstractGraph

isPredecessor(V, V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

Returns true iff v1 is the parent of v2.

isRoot(V) - Method in class edu.uci.ics.jung.graph.DelegateForest

isRoot(V) - Method in class edu.uci.ics.jung.graph.DelegateTree

isRoot(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

Returns true if vertex is a leaf of this tree, i.e., if it has no children.

isSource(V, E) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

isSource(V, E) - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

isSource(V, E) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

isSource(V, E) - Method in class edu.uci.ics.jung.graph.SparseGraph

isSource(V, E) - Method in class edu.uci.ics.jung.graph.SparseMultigraph

isSource(V, E) - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph

isSource(V, E) - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

isSuccessor(V, V) - Method in class edu.uci.ics.jung.graph.AbstractGraph

isSuccessor(V, V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

O

order - Variable in class edu.uci.ics.jung.graph.OrderedKAryTree

OrderedKAryTree<V,E> - Class in edu.uci.ics.jung.graph

An implementation of Tree in which each vertex has ≤ k children.

OrderedKAryTree(int) - Constructor for class edu.uci.ics.jung.graph.OrderedKAryTree

Creates a new instance with the specified order (maximum number of children).

OrderedKAryTree.VertexData - Class in edu.uci.ics.jung.graph

OrderedSparseMultigraph<V,E> - Class in edu.uci.ics.jung.graph

An implementation of Graph that orders its vertex and edge collections according to insertion time, is suitable for sparse graphs, and permits directed, undirected, and parallel edges.

OrderedSparseMultigraph() - Constructor for class edu.uci.ics.jung.graph.OrderedSparseMultigraph

Creates a new instance.

outDegree(V) - Method in class edu.uci.ics.jung.graph.AbstractGraph

outDegree(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

outDegree(V) - Method in class edu.uci.ics.jung.graph.SetHypergraph

OUTGOING - Static variable in class edu.uci.ics.jung.graph.SparseGraph

P

pairs - Static variable in class edu.uci.ics.jung.graph.util.TestGraphs

A series of pairs that may be useful for generating graphs.

R

removeChild(V) - Method in class edu.uci.ics.jung.graph.DelegateForest

removes a node from the tree, causing all descendants of the removed node also to be removed

removeChild(V) - Method in class edu.uci.ics.jung.graph.DelegateTree

removes a node from the tree, causing all descendants of the removed node also to be removed

removeEdge(E) - Method in class edu.uci.ics.jung.graph.DelegateForest

Removes edge from this tree, and the subtree rooted at the child vertex incident to edge.

removeEdge(E, boolean) - Method in class edu.uci.ics.jung.graph.DelegateForest

Removes edge from this tree.

removeEdge(E) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

removeEdge(E) - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

removeEdge(E) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

removeEdge(H) - Method in class edu.uci.ics.jung.graph.SetHypergraph

removeEdge(E) - Method in class edu.uci.ics.jung.graph.SparseGraph

removeEdge(E) - Method in class edu.uci.ics.jung.graph.SparseMultigraph

removeEdge(E) - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph

removeEdge(E) - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

removeVertex(V) - Method in class edu.uci.ics.jung.graph.DelegateForest

Removes vertex from this tree, and the subtree rooted at vertex.

removeVertex(V, boolean) - Method in class edu.uci.ics.jung.graph.DelegateForest

Removes vertex from this tree.

removeVertex(V) - Method in class edu.uci.ics.jung.graph.DelegateTree

remove the passed node, and all nodes that are descendants of the passed node.

removeVertex(V) - Method in class edu.uci.ics.jung.graph.DirectedSparseGraph

removeVertex(V) - Method in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

removeVertex(V) - Method in class edu.uci.ics.jung.graph.OrderedKAryTree

removeVertex(V) - Method in class edu.uci.ics.jung.graph.SetHypergraph

removeVertex(V) - Method in class edu.uci.ics.jung.graph.SparseGraph

removeVertex(V) - Method in class edu.uci.ics.jung.graph.SparseMultigraph

removeVertex(V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseGraph

removeVertex(V) - Method in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

root - Variable in class edu.uci.ics.jung.graph.DelegateTree

root - Variable in class edu.uci.ics.jung.graph.OrderedKAryTree

S

SetHypergraph<V,H> - Class in edu.uci.ics.jung.graph

An implementation of Hypergraph that is suitable for sparse graphs and permits parallel edges.

SetHypergraph() - Constructor for class edu.uci.ics.jung.graph.SetHypergraph

Creates a SetHypergraph and initializes the internal data structures.

setRoot(V) - Method in class edu.uci.ics.jung.graph.DelegateForest

adds root as a root of the tree

setRoot(V) - Method in class edu.uci.ics.jung.graph.DelegateTree

sets the root to the passed value, only if the root is previously unset

setVertexComparator(Comparator<V>) - Method in class edu.uci.ics.jung.graph.SortedSparseMultigraph

Provides a new Comparator to be used in sorting the vertices.

SortedSparseMultigraph<V,E> - Class in edu.uci.ics.jung.graph

An implementation of Graph that is suitable for sparse graphs, orders its vertex and edge collections according to either specified Comparator instances or the natural ordering of their elements, and permits directed, undirected, and parallel edges.

SortedSparseMultigraph(Comparator<V>, Comparator<E>) - Constructor for class edu.uci.ics.jung.graph.SortedSparseMultigraph

Creates a new instance which sorts its vertices and edges according to the specified Comparators.

SortedSparseMultigraph() - Constructor for class edu.uci.ics.jung.graph.SortedSparseMultigraph

Creates a new instance which sorts its vertices and edges according to their natural ordering.

SparseGraph<V,E> - Class in edu.uci.ics.jung.graph

An implementation of Graph that is suitable for sparse graphs and permits both directed and undirected edges.

SparseGraph() - Constructor for class edu.uci.ics.jung.graph.SparseGraph

Creates an instance.

SparseMultigraph<V,E> - Class in edu.uci.ics.jung.graph

An implementation of Graph that is suitable for sparse graphs and permits directed, undirected, and parallel edges.

SparseMultigraph() - Constructor for class edu.uci.ics.jung.graph.SparseMultigraph

Creates a new instance.

T

TestGraphs - Class in edu.uci.ics.jung.graph.util

Provides generators for several different test graphs.

TestGraphs() - Constructor for class edu.uci.ics.jung.graph.util.TestGraphs

toString() - Method in class edu.uci.ics.jung.graph.AbstractGraph

toString() - Method in class edu.uci.ics.jung.graph.DelegateTree

U

undirected_edges - Variable in class edu.uci.ics.jung.graph.SparseGraph

UndirectedOrderedSparseMultigraph<V,E> - Class in edu.uci.ics.jung.graph

An implementation of UndirectedGraph that is suitable for sparse graphs, orders its vertex and edge collections according to insertion time, and permits parallel edges.

UndirectedOrderedSparseMultigraph() - Constructor for class edu.uci.ics.jung.graph.UndirectedOrderedSparseMultigraph

Creates a new instance.

UndirectedSparseGraph<V,E> - Class in edu.uci.ics.jung.graph

An implementation of UndirectedGraph that is suitable for sparse graphs.

UndirectedSparseGraph() - Constructor for class edu.uci.ics.jung.graph.UndirectedSparseGraph

Creates an instance.

UndirectedSparseMultigraph<V,E> - Class in edu.uci.ics.jung.graph

An implementation of UndirectedGraph that is suitable for sparse graphs and permits parallel edges.

UndirectedSparseMultigraph() - Constructor for class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

Creates a new instance.

V

validateEdgeType(EdgeType) - Method in class edu.uci.ics.jung.graph.AbstractTypedGraph

Throws an IllegalArgumentException if edge_type does not match the default edge type for this graph.

vertex_comparator - Variable in class edu.uci.ics.jung.graph.SortedSparseMultigraph

Comparator used in ordering vertices.

vertex_data - Variable in class edu.uci.ics.jung.graph.OrderedKAryTree

vertex_depths - Variable in class edu.uci.ics.jung.graph.DelegateTree

vertex_maps - Variable in class edu.uci.ics.jung.graph.SparseGraph

VertexData(E, int) - Constructor for class edu.uci.ics.jung.graph.OrderedKAryTree.VertexData

vertices - Variable in class edu.uci.ics.jung.graph.DirectedSparseGraph

vertices - Variable in class edu.uci.ics.jung.graph.DirectedSparseMultigraph

vertices - Variable in class edu.uci.ics.jung.graph.SetHypergraph

vertices - Variable in class edu.uci.ics.jung.graph.SparseMultigraph

vertices - Variable in class edu.uci.ics.jung.graph.UndirectedSparseGraph

vertices - Variable in class edu.uci.ics.jung.graph.UndirectedSparseMultigraph

A C D E F G H I O P R S T U V