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

A

add(T) - Method in class edu.uci.ics.jung.graph.util.Pair

addAll(Collection<? extends T>) - Method in class edu.uci.ics.jung.graph.util.Pair

addEdge(E, V, V) - Method in interface edu.uci.ics.jung.graph.Graph

Adds edge e to this graph such that it connects vertex v1 to v2.

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

Adds edge e to this graph such that it connects vertex v1 to v2.

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

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

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

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

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

Adds edge to this graph.

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

Adds edge to this graph with type edge_type.

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

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

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

addFromSubTree(Forest<V, E>, Forest<V, E>, E, V, V) - Static method in class edu.uci.ics.jung.graph.util.TreeUtils

addGraphEventListener(GraphEventListener<V, E>) - Method in class edu.uci.ics.jung.graph.ObservableGraph

Adds l as a listener to this graph.

addSubTree(Forest<V, E>, Forest<V, E>, V, E) - Static method in class edu.uci.ics.jung.graph.util.TreeUtils

Connects subTree to tree by attaching it as a child of node with edge connectingEdge.

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

addVertex(V) - Method in interface edu.uci.ics.jung.graph.Hypergraph

Adds vertex to this graph.

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

C

clear() - Method in class edu.uci.ics.jung.graph.util.Pair

contains(Object) - Method in class edu.uci.ics.jung.graph.util.Pair

containsAll(Collection<?>) - Method in class edu.uci.ics.jung.graph.util.Pair

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

containsEdge(E) - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns true if this graph's edge collection contains edge.

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

containsVertex(V) - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns true if this graph's vertex collection contains vertex.

Context<G,E> - Class in edu.uci.ics.jung.graph.util

A class that is used to link together a graph element and a specific graph.

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

D

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

A class which creates and maintains indices for parallel edges.

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

degree(V) - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns the number of edges incident to vertex.

delegate - Variable in class edu.uci.ics.jung.graph.GraphDecorator

DirectedGraph<V,E> - Interface in edu.uci.ics.jung.graph

A tagging interface for implementations of Graph that accept only directed edges.

E

Edge(Graph<V, E>, GraphEvent.Type, E) - Constructor for class edu.uci.ics.jung.graph.event.GraphEvent.Edge

Creates a graph event for the specified graph, edge, and type.

edge - Variable in class edu.uci.ics.jung.graph.event.GraphEvent.Edge

edge_index - Variable in class edu.uci.ics.jung.graph.util.DefaultParallelEdgeIndexFunction

edge_index - Variable in class edu.uci.ics.jung.graph.util.IncidentEdgeIndexFunction

EdgeIndexFunction<V,E> - Interface in edu.uci.ics.jung.graph.util

An interface for a service to access the index of a given edge (in a given graph) into the set formed by the given edge and all the other edges it is parallel to.

EdgeType - Enum in edu.uci.ics.jung.graph.util

Defines the possible edge types for graphs which assign types to edges.

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

Interfaces for the JUNG graph types, and some representative implementations.

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

Support for generating events in response to graph actions, especially mutations.

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

Utility interfaces and classes for the JUNG API.

element - Variable in class edu.uci.ics.jung.graph.util.Context

The edge element which defines this context.

equals(Object) - Method in class edu.uci.ics.jung.graph.util.Context

equals(Object) - Method in class edu.uci.ics.jung.graph.util.Pair

F

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

findEdge(V, V) - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns an edge that connects this vertex to v.

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

findEdgeSet(V, V) - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns all edges that connects this vertex to v.

fireGraphEvent(GraphEvent<V, E>) - Method in class edu.uci.ics.jung.graph.ObservableGraph

Forest<V,E> - Interface in edu.uci.ics.jung.graph

An interface for a graph which consists of a collection of rooted directed acyclic graphs.

G

getChildCount(V) - Method in interface edu.uci.ics.jung.graph.Forest

Returns the number of children that vertex has in this tree.

getChildEdges(V) - Method in interface edu.uci.ics.jung.graph.Forest

Returns the edges connecting vertex to its children in this tree.

getChildren(V) - Method in interface edu.uci.ics.jung.graph.Forest

Returns the children of vertex in this tree.

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

getDefaultEdgeType() - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns the default edge type for this graph.

getDepth(V) - Method in interface edu.uci.ics.jung.graph.Tree

Returns the (unweighted) distance of vertex from the root of this tree.

getDest(E) - Method in interface edu.uci.ics.jung.graph.Graph

If directed_edge is a directed edge in this graph, returns the destination; otherwise returns null.

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

getDest(E) - Method in interface edu.uci.ics.jung.graph.Hypergraph

If directed_edge is a directed edge in this graph, returns the destination; otherwise returns null.

getEdge() - Method in class edu.uci.ics.jung.graph.event.GraphEvent.Edge

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

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

getEdgeCount() - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns the number of edges in this graph.

getEdgeCount(EdgeType) - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns the number of edges of type edge_type in this graph.

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

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

getEdges() - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns a view of all edges in this graph.

getEdges(EdgeType) - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns the collection of edges in this graph which are of type edge_type.

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

getEdgeType(E) - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns the edge type of edge in this graph.

getEndpoints(E) - Method in interface edu.uci.ics.jung.graph.Graph

Returns the endpoints of edge as a Pair.

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

getFirst() - Method in class edu.uci.ics.jung.graph.util.Pair

getHeight() - Method in interface edu.uci.ics.jung.graph.Tree

Returns the maximum depth in this tree.

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

getIncidentCount(E) - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns the number of vertices that are incident to edge.

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

getIncidentEdges(V) - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns the collection of edges in this graph which are connected to vertex.

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

getIncidentVertices(E) - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns the collection of vertices in this graph which are connected to edge.

getIndex(Graph<V, E>, E) - Method in class edu.uci.ics.jung.graph.util.DefaultParallelEdgeIndexFunction

Returns the index for e in graph.

getIndex(Graph<V, E>, E, V, V) - Method in class edu.uci.ics.jung.graph.util.DefaultParallelEdgeIndexFunction

getIndex(Graph<V, E>, E, V) - Method in class edu.uci.ics.jung.graph.util.DefaultParallelEdgeIndexFunction

getIndex(Graph<V, E>, E) - Method in interface edu.uci.ics.jung.graph.util.EdgeIndexFunction

Returns e's index in graph.

getIndex(Graph<V, E>, E) - Method in class edu.uci.ics.jung.graph.util.IncidentEdgeIndexFunction

Returns the index for the specified edge.

getIndex(Graph<V, E>, E, V, V) - Method in class edu.uci.ics.jung.graph.util.IncidentEdgeIndexFunction

getIndex(Graph<V, E>, E, V) - Method in class edu.uci.ics.jung.graph.util.IncidentEdgeIndexFunction

getInEdges(V) - Method in interface edu.uci.ics.jung.graph.Graph

Returns a Collection view of the incoming edges incident to vertex in this graph.

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

getInEdges(V) - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns a Collection view of the incoming edges incident to vertex in this graph.

getInstance(G, E) - Static method in class edu.uci.ics.jung.graph.util.Context

getInstance() - Static method in class edu.uci.ics.jung.graph.util.DefaultParallelEdgeIndexFunction

getInstance() - Static method in class edu.uci.ics.jung.graph.util.IncidentEdgeIndexFunction

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

getNeighborCount(V) - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns the number of vertices that are adjacent to vertex (that is, the number of vertices that are incident to edges in vertex's incident edge set).

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

getNeighbors(V) - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns the collection of vertices which are connected to vertex via any edges in this graph.

getOpposite(V, E) - Method in interface edu.uci.ics.jung.graph.Graph

Returns the vertex at the other end of edge from vertex.

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

getOutEdges(V) - Method in interface edu.uci.ics.jung.graph.Graph

Returns a Collection view of the outgoing edges incident to vertex in this graph.

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

getOutEdges(V) - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns a Collection view of the outgoing edges incident to vertex in this graph.

getParent(V) - Method in interface edu.uci.ics.jung.graph.Forest

Returns the parent of vertex in this tree.

getParentEdge(V) - Method in interface edu.uci.ics.jung.graph.Forest

Returns the edge connecting vertex to its parent in this tree.

getPartitions() - Method in interface edu.uci.ics.jung.graph.KPartiteGraph

Returns the set of Predicate instances which define this graph's partitions.

getPredecessorCount(V) - Method in interface edu.uci.ics.jung.graph.Graph

Returns the number of predecessors that vertex has in this graph.

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

getPredecessors(V) - Method in interface edu.uci.ics.jung.graph.Graph

Returns a Collection view of the predecessors of vertex in this graph.

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

getPredecessors(V) - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns a Collection view of the predecessors of vertex in this graph.

getRoot() - Method in interface edu.uci.ics.jung.graph.Tree

Returns the root of this tree.

getRoots(Forest<V, E>) - Static method in class edu.uci.ics.jung.graph.util.TreeUtils

getSecond() - Method in class edu.uci.ics.jung.graph.util.Pair

getSource() - Method in class edu.uci.ics.jung.graph.event.GraphEvent

getSource(E) - Method in interface edu.uci.ics.jung.graph.Graph

If directed_edge is a directed edge in this graph, returns the source; otherwise returns null.

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

getSource(E) - Method in interface edu.uci.ics.jung.graph.Hypergraph

If directed_edge is a directed edge in this graph, returns the source; otherwise returns null.

getSubTree(Forest<V, E>, V) - Static method in class edu.uci.ics.jung.graph.util.TreeUtils

Returns the subtree of tree which is rooted at root as a Forest.

getSuccessorCount(V) - Method in interface edu.uci.ics.jung.graph.Graph

Returns the number of successors that vertex has in this graph.

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

getSuccessors(V) - Method in interface edu.uci.ics.jung.graph.Graph

Returns a Collection view of the successors of vertex in this graph.

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

getSuccessors(V) - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns a Collection view of the successors of vertex in this graph.

getTrees() - Method in interface edu.uci.ics.jung.graph.Forest

Returns a view of this graph as a collection of Tree instances.

getType() - Method in class edu.uci.ics.jung.graph.event.GraphEvent

getVertex() - Method in class edu.uci.ics.jung.graph.event.GraphEvent.Vertex

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

getVertexCount() - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns the number of vertices in this graph.

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

getVertices() - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns a view of all vertices in this graph.

getVertices(Predicate<V>) - Method in interface edu.uci.ics.jung.graph.KPartiteGraph

Returns all vertices which satisfy the specified partition predicate.

Graph<V,E> - Interface in edu.uci.ics.jung.graph

A graph consisting of a set of vertices of type V set and a set of edges of type E.

graph - Variable in class edu.uci.ics.jung.graph.util.Context

The graph element which defines this context.

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

An implementation of Graph that delegates its method calls to a constructor-specified Graph instance.

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

Creates a new instance based on the provided delegate.

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

GraphEvent(Graph<V, E>, GraphEvent.Type) - Constructor for class edu.uci.ics.jung.graph.event.GraphEvent

Creates an instance with the specified source graph and Type (vertex/edge addition/removal).

GraphEvent.Edge<V,E> - Class in edu.uci.ics.jung.graph.event

An event type pertaining to graph edges.

GraphEvent.Type - Enum in edu.uci.ics.jung.graph.event

Types of graph events.

GraphEvent.Vertex<V,E> - Class in edu.uci.ics.jung.graph.event

An event type pertaining to graph vertices.

GraphEventListener<V,E> - Interface in edu.uci.ics.jung.graph.event

An interface for classes that listen for graph events.

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

Provides specialized implementations of GraphDecorator.

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

growSubTree(Forest<V, E>, Forest<V, E>, V) - Static method in class edu.uci.ics.jung.graph.util.TreeUtils

Populates subtree with the subtree of tree which is rooted at root.

H

handleGraphEvent(GraphEvent<V, E>) - Method in interface edu.uci.ics.jung.graph.event.GraphEventListener

Method called by the process generating a graph event to which this instance is listening.

hashCode() - Method in class edu.uci.ics.jung.graph.util.Context

hashCode() - Method in class edu.uci.ics.jung.graph.util.Pair

Hypergraph<V,E> - Interface in edu.uci.ics.jung.graph

A hypergraph, consisting of a set of vertices of type V and a set of hyperedges of type E which connect the vertices.

I

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

A class which creates and maintains indices for incident edges.

inDegree(V) - Method in interface edu.uci.ics.jung.graph.Graph

Returns the number of incoming edges incident to vertex.

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

inDegree(V) - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns the number of incoming edges incident to vertex.

isDest(V, E) - Method in interface edu.uci.ics.jung.graph.Graph

Returns true if vertex is the destination of edge.

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

isEmpty() - Method in class edu.uci.ics.jung.graph.util.Pair

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

isIncident(V, E) - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns true if vertex and edge are incident to each other.

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

isNeighbor(V, V) - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns true if v1 and v2 share an incident edge.

isPredecessor(V, V) - Method in interface edu.uci.ics.jung.graph.Graph

Returns true if v1 is a predecessor of v2 in this graph.

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

isSource(V, E) - Method in interface edu.uci.ics.jung.graph.Graph

Returns true if vertex is the source of edge.

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

isSuccessor(V, V) - Method in interface edu.uci.ics.jung.graph.Graph

Returns true if v1 is a successor of v2 in this graph.

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

iterator() - Method in class edu.uci.ics.jung.graph.util.Pair

K

KPartiteGraph<V,E> - Interface in edu.uci.ics.jung.graph

An interface for graphs whose vertices are each members of one of 2 or more disjoint sets (partitions), and whose edges connect only vertices in distinct partitions.

M

MultiGraph<V,E> - Interface in edu.uci.ics.jung.graph

A tagging interface which indicates that the implementing graph accepts parallel edges.

O

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

A decorator class for graphs which generates events

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

Creates a new instance based on the provided delegate.

outDegree(V) - Method in interface edu.uci.ics.jung.graph.Graph

Returns the number of outgoing edges incident to vertex.

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

outDegree(V) - Method in interface edu.uci.ics.jung.graph.Hypergraph

Returns the number of outgoing edges incident to vertex.

P

Pair<T> - Class in edu.uci.ics.jung.graph.util

An implementation of Collection that stores exactly 2 non-null objects and is not mutable.

Pair(T, T) - Constructor for class edu.uci.ics.jung.graph.util.Pair

Creates a Pair from the specified elements.

Pair(Collection<? extends T>) - Constructor for class edu.uci.ics.jung.graph.util.Pair

Creates a Pair from the passed Collection.

Pair(T[]) - Constructor for class edu.uci.ics.jung.graph.util.Pair

Creates a Pair from the passed array.

R

remove(Object) - Method in class edu.uci.ics.jung.graph.util.Pair

removeAll(Collection<?>) - Method in class edu.uci.ics.jung.graph.util.Pair

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

removeEdge(E) - Method in interface edu.uci.ics.jung.graph.Hypergraph

Removes edge from this graph.

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

removeGraphEventListener(GraphEventListener<V, E>) - Method in class edu.uci.ics.jung.graph.ObservableGraph

Removes l as a listener to this graph.

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

removeVertex(V) - Method in interface edu.uci.ics.jung.graph.Hypergraph

Removes vertex from this graph.

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

reset(Graph<V, E>, E) - Method in class edu.uci.ics.jung.graph.util.DefaultParallelEdgeIndexFunction

Resets the indices for this edge and its parallel edges.

reset() - Method in class edu.uci.ics.jung.graph.util.DefaultParallelEdgeIndexFunction

Clears all edge indices for all edges in all graphs.

reset(Graph<V, E>, E) - Method in interface edu.uci.ics.jung.graph.util.EdgeIndexFunction

Resets the indices for edge and its parallel edges in graph.

reset() - Method in interface edu.uci.ics.jung.graph.util.EdgeIndexFunction

Clears all edge indices for all edges in all graphs.

reset(Graph<V, E>, E) - Method in class edu.uci.ics.jung.graph.util.IncidentEdgeIndexFunction

Resets the indices for this edge and its parallel edges.

reset() - Method in class edu.uci.ics.jung.graph.util.IncidentEdgeIndexFunction

Clears all edge indices for all edges in all graphs.

retainAll(Collection<?>) - Method in class edu.uci.ics.jung.graph.util.Pair

S

size() - Method in class edu.uci.ics.jung.graph.util.Pair

source - Variable in class edu.uci.ics.jung.graph.event.GraphEvent

synchronizedDirectedGraph(DirectedGraph<V, E>) - Static method in class edu.uci.ics.jung.graph.util.Graphs

Returns a synchronized DirectedGraph backed by the passed DirectedGraph.

synchronizedForest(Forest<V, E>) - Static method in class edu.uci.ics.jung.graph.util.Graphs

Returns a synchronized Forest backed by the passed Forest.

synchronizedGraph(Graph<V, E>) - Static method in class edu.uci.ics.jung.graph.util.Graphs

Returns a synchronized graph backed by the passed argument graph.

synchronizedTree(Tree<V, E>) - Static method in class edu.uci.ics.jung.graph.util.Graphs

Returns a synchronized Tree backed by the passed Tree.

synchronizedUndirectedGraph(UndirectedGraph<V, E>) - Static method in class edu.uci.ics.jung.graph.util.Graphs

Returns a synchronized UndirectedGraph backed by the passed UndirectedGraph.

T

toArray() - Method in class edu.uci.ics.jung.graph.util.Pair

toArray(S[]) - Method in class edu.uci.ics.jung.graph.util.Pair

toString() - Method in class edu.uci.ics.jung.graph.event.GraphEvent.Edge

toString() - Method in class edu.uci.ics.jung.graph.event.GraphEvent.Vertex

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

Tree<V,E> - Interface in edu.uci.ics.jung.graph

A subtype of Graph which is a (directed, rooted) tree.

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

Contains static methods for operating on instances of Tree.

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

type - Variable in class edu.uci.ics.jung.graph.event.GraphEvent

U

UndirectedGraph<V,E> - Interface in edu.uci.ics.jung.graph

A tagging interface for extensions of Graph that accept only undirected edges.

unmodifiableDirectedGraph(DirectedGraph<V, E>) - Static method in class edu.uci.ics.jung.graph.util.Graphs

Returns an unmodifiable DirectedGraph backed by the passed graph.

unmodifiableForest(Forest<V, E>) - Static method in class edu.uci.ics.jung.graph.util.Graphs

Returns an unmodifiable Forest backed by the passed forest.

unmodifiableGraph(Graph<V, E>) - Static method in class edu.uci.ics.jung.graph.util.Graphs

Returns an unmodifiable Graph backed by the passed Graph.

unmodifiableTree(Tree<V, E>) - Static method in class edu.uci.ics.jung.graph.util.Graphs

Returns an unmodifiable Tree backed by the passed tree.

unmodifiableUndirectedGraph(UndirectedGraph<V, E>) - Static method in class edu.uci.ics.jung.graph.util.Graphs

Returns an unmodifiable UndirectedGraph backed by the passed graph.

V

valueOf(String) - Static method in enum edu.uci.ics.jung.graph.event.GraphEvent.Type

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

valueOf(String) - Static method in enum edu.uci.ics.jung.graph.util.EdgeType

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

values() - Static method in enum edu.uci.ics.jung.graph.event.GraphEvent.Type

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

values() - Static method in enum edu.uci.ics.jung.graph.util.EdgeType

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

Vertex(Graph<V, E>, GraphEvent.Type, V) - Constructor for class edu.uci.ics.jung.graph.event.GraphEvent.Vertex

Creates a graph event for the specified graph, vertex, and type.

vertex - Variable in class edu.uci.ics.jung.graph.event.GraphEvent.Vertex

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