Uses of Interface
edu.uci.ics.jung.graph.Graph

Packages that use Graph

Package	Description
edu.uci.ics.jung.algorithms.layout	Algorithms for assigning 2D coordinates (typically used for graph visualizations) to vertices.
edu.uci.ics.jung.algorithms.path	Contains path classes for the layout packages.
edu.uci.ics.jung.graph	Interfaces for the JUNG graph types, and some representative implementations.
edu.uci.ics.jung.graph.event	Support for generating events in response to graph actions, especially mutations.
edu.uci.ics.jung.graph.util	Utility interfaces and classes for the JUNG API.
org.girod.jgraphml.model	This package contains the graphml model classes.

Uses of Graph in edu.uci.ics.jung.algorithms.layout

Fields in edu.uci.ics.jung.algorithms.layout declared as Graph

Modifier and Type	Field and Description
protected Graph<V,E>	AbstractLayout.graph

Methods in edu.uci.ics.jung.algorithms.layout that return Graph

Modifier and Type	Method and Description
Graph<V,E>	AbstractLayout.getGraph() Accessor for the graph that represets all vertices.
Graph<V,E>	AggregateLayout.getGraph() Returns the graph for which this layout is defined.
Graph<V,E>	Layout.getGraph() Returns the full graph (the one that was passed in at construction time) that this Layout refers to.
Graph<V,E>	LayoutDecorator.getGraph()
Graph<V,E>	TreeLayout.getGraph()

Methods in edu.uci.ics.jung.algorithms.layout with parameters of type Graph

Modifier and Type	Method and Description
void	AbstractLayout.setGraph(Graph<V,E> graph)
void	AggregateLayout.setGraph(Graph<V,E> graph)
void	Layout.setGraph(Graph<V,E> graph) setter for graph
void	LayoutDecorator.setGraph(Graph<V,E> graph)
void	TreeLayout.setGraph(Graph<V,E> graph)
void	DAGLayout.setRoot(Graph<V,E> g) setRoot calculates the level of each vertex in the graph.

Constructors in edu.uci.ics.jung.algorithms.layout with parameters of type Graph

Constructor and Description
AbstractLayout(Graph<V,E> graph) Creates an instance which does not initialize the vertex locations.
AbstractLayout(Graph<V,E> graph, java.awt.Dimension size)
AbstractLayout(Graph<V,E> graph, org.apache.commons.collections15.Transformer<V,java.awt.geom.Point2D> initializer)
AbstractLayout(Graph<V,E> graph, org.apache.commons.collections15.Transformer<V,java.awt.geom.Point2D> initializer, java.awt.Dimension size)
CircleLayout(Graph<V,E> g) Creates an instance for the specified graph.
DAGLayout(Graph<V,E> g) Creates an instance for the specified graph.
FRLayout(Graph<V,E> g) Creates an instance for the specified graph.
FRLayout(Graph<V,E> g, java.awt.Dimension d) Creates an instance of size d for the specified graph.
FRLayout2(Graph<V,E> g) Creates an instance for the specified graph.
FRLayout2(Graph<V,E> g, java.awt.Dimension d) Creates an instance of size d for the specified graph.
ISOMLayout(Graph<V,E> g) Creates an ISOMLayout instance for the specified graph g.
KKLayout(Graph<V,E> g) Creates an instance for the specified graph.
KKLayout(Graph<V,E> g, Distance<V> distance) Creates an instance for the specified graph and distance metric.
SpringLayout(Graph<V,E> g) Constructor for a SpringLayout for a raw graph with associated dimension--the input knows how big the graph is.
SpringLayout(Graph<V,E> g, org.apache.commons.collections15.Transformer<E,java.lang.Integer> length_function) Constructor for a SpringLayout for a raw graph with associated component.
SpringLayout2(Graph<V,E> g) Constructor for a SpringLayout for a raw graph with associated dimension--the input knows how big the graph is.
SpringLayout2(Graph<V,E> g, org.apache.commons.collections15.Transformer<E,java.lang.Integer> length_function) Constructor for a SpringLayout for a raw graph with associated component.
StaticLayout(Graph<V,E> graph) Creates an instance for the specified graph and default size; vertex locations are randomly assigned.
StaticLayout(Graph<V,E> graph, java.awt.Dimension size) Creates an instance for the specified graph and size.
StaticLayout(Graph<V,E> graph, org.apache.commons.collections15.Transformer<V,java.awt.geom.Point2D> initializer) Creates an instance for the specified graph and locations, with default size.
StaticLayout(Graph<V,E> graph, org.apache.commons.collections15.Transformer<V,java.awt.geom.Point2D> initializer, java.awt.Dimension size) Creates an instance for the specified graph, locations, and size.
SugiyamaLayout(Graph<V,E> g)
SugiyamaLayout(Graph<V,E> g, SugiyamaLayout.Orientation orientation, int horzSpacing, int vertSpacing)

Uses of Graph in edu.uci.ics.jung.algorithms.path

Constructors in edu.uci.ics.jung.algorithms.path with parameters of type Graph

Constructor and Description
DijkstraDistance(Graph<V,E> g) Creates an instance of DijkstraShortestPath for the specified unweighted graph (that is, all weights 1) which caches results locally.
DijkstraDistance(Graph<V,E> g, boolean cached) Creates an instance of DijkstraShortestPath for the specified unweighted graph (that is, all weights 1) which caches results locally.

Uses of Graph in edu.uci.ics.jung.graph

Subinterfaces of Graph in edu.uci.ics.jung.graph

Modifier and Type	Interface and Description
interface	DirectedGraph<V,E> A tagging interface for implementations of Graph that accept only directed edges.
interface	Forest<V,E> An interface for a graph which consists of a collection of rooted directed acyclic graphs.
interface	Tree<V,E> A subtype of Graph which is a (directed, rooted) tree.
interface	UndirectedGraph<V,E> A tagging interface for extensions of Graph that accept only undirected edges.

Classes in edu.uci.ics.jung.graph that implement Graph

Modifier and Type	Class and Description
class	AbstractGraph<V,E> Abstract implementation of the Graph interface.
class	AbstractTypedGraph<V,E> An abstract class for graphs whose edges all have the same EdgeType.
class	DelegateForest<V,E> An implementation of Forest that delegates to a specified DirectedGraph instance.
class	DelegateTree<V,E> An implementation of Tree that delegates to a specified instance of DirectedGraph.
class	DirectedOrderedSparseMultigraph<V,E> An implementation of DirectedGraph, suitable for sparse graphs, that orders its vertex and edge collections according to insertion time.
class	DirectedSparseGraph<V,E> An implementation of DirectedGraph suitable for sparse graphs.
class	DirectedSparseMultigraph<V,E> An implementation of DirectedGraph, suitable for sparse graphs, that permits parallel edges.
class	GraphDecorator<V,E> An implementation of Graph that delegates its method calls to a constructor-specified Graph instance.
class	ObservableGraph<V,E> A decorator class for graphs which generates events
class	OrderedKAryTree<V,E> An implementation of Tree in which each vertex has <= k children.
class	OrderedSparseMultigraph<V,E> 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.
class	SortedSparseMultigraph<V,E> 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.
class	SparseGraph<V,E> An implementation of Graph that is suitable for sparse graphs and permits both directed and undirected edges.
class	SparseMultigraph<V,E> An implementation of Graph that is suitable for sparse graphs and permits directed, undirected, and parallel edges.
class	UndirectedOrderedSparseMultigraph<V,E> An implementation of UndirectedGraph that is suitable for sparse graphs, orders its vertex and edge collections according to insertion time, and permits parallel edges.
class	UndirectedSparseGraph<V,E> An implementation of UndirectedGraph that is suitable for sparse graphs.
class	UndirectedSparseMultigraph<V,E> An implementation of UndirectedGraph that is suitable for sparse graphs and permits parallel edges.

Fields in edu.uci.ics.jung.graph declared as Graph

Modifier and Type	Field and Description
protected Graph<V,E>	GraphDecorator.delegate

Methods in edu.uci.ics.jung.graph that return types with arguments of type Graph

Modifier and Type	Method and Description
static <V,E> Factory<Graph<V,E>>	OrderedSparseMultigraph.getFactory() Returns a Factory that creates an instance of this graph type.
static <V,E> Factory<Graph<V,E>>	SortedSparseMultigraph.getFactory() Returns a Factory that creates an instance of this graph type.
static <V,E> Factory<Graph<V,E>>	SparseGraph.getFactory() Returns a Factory that creates an instance of this graph type.
static <V,E> Factory<Graph<V,E>>	SparseMultigraph.getFactory() Returns a Factory that creates an instance of this graph type.

Constructors in edu.uci.ics.jung.graph with parameters of type Graph

Constructor and Description
GraphDecorator(Graph<V,E> delegate) Creates a new instance based on the provided delegate.
ObservableGraph(Graph<V,E> delegate) Creates a new instance based on the provided delegate.

Uses of Graph in edu.uci.ics.jung.graph.event

Fields in edu.uci.ics.jung.graph.event declared as Graph

Modifier and Type	Field and Description
protected Graph<V,E>	GraphEvent.source

Methods in edu.uci.ics.jung.graph.event that return Graph

Modifier and Type	Method and Description
Graph<V,E>	GraphEvent.getSource()

Constructors in edu.uci.ics.jung.graph.event with parameters of type Graph

Constructor and Description
Edge(Graph<V,E> source, GraphEvent.Type type, E edge) Creates a graph event for the specified graph, edge, and type.
GraphEvent(Graph<V,E> source, GraphEvent.Type type) Creates an instance with the specified source graph and Type (vertex/edge addition/removal).
Vertex(Graph<V,E> source, GraphEvent.Type type, V vertex) Creates a graph event for the specified graph, vertex, and type.

Uses of Graph in edu.uci.ics.jung.graph.util

Fields in edu.uci.ics.jung.graph.util with type parameters of type Graph

Modifier and Type	Field and Description
protected java.util.Map<Context<Graph<V,E>,E>,java.lang.Integer>	DefaultParallelEdgeIndexFunction.edge_index

Methods in edu.uci.ics.jung.graph.util that return Graph

Modifier and Type	Method and Description
static <V,E> Graph<V,E>	Graphs.synchronizedGraph(Graph<V,E> graph) Returns a synchronized graph backed by the passed argument graph.
static <V,E> Graph<V,E>	Graphs.unmodifiableGraph(Graph<V,E> graph) Returns an unmodifiable Graph backed by the passed Graph.

Methods in edu.uci.ics.jung.graph.util with parameters of type Graph

Modifier and Type	Method and Description
int	DefaultParallelEdgeIndexFunction.getIndex(Graph<V,E> graph, E e) Returns the index for e in graph.
int	EdgeIndexFunction.getIndex(Graph<V,E> graph, E e) Returns e's index in graph.
int	IncidentEdgeIndexFunction.getIndex(Graph<V,E> graph, E e) Returns the index for the specified edge.
protected int	DefaultParallelEdgeIndexFunction.getIndex(Graph<V,E> graph, E e, V v)
protected int	IncidentEdgeIndexFunction.getIndex(Graph<V,E> graph, E e, V v)
protected int	DefaultParallelEdgeIndexFunction.getIndex(Graph<V,E> graph, E e, V v, V u)
protected int	IncidentEdgeIndexFunction.getIndex(Graph<V,E> graph, E e, V u, V v)
void	DefaultParallelEdgeIndexFunction.reset(Graph<V,E> graph, E e) Resets the indices for this edge and its parallel edges.
void	EdgeIndexFunction.reset(Graph<V,E> g, E edge) Resets the indices for edge and its parallel edges in graph.
void	IncidentEdgeIndexFunction.reset(Graph<V,E> graph, E e) Resets the indices for this edge and its parallel edges.
static <V,E> Graph<V,E>	Graphs.synchronizedGraph(Graph<V,E> graph) Returns a synchronized graph backed by the passed argument graph.
static <V,E> Graph<V,E>	Graphs.unmodifiableGraph(Graph<V,E> graph) Returns an unmodifiable Graph backed by the passed Graph.

Uses of Graph in org.girod.jgraphml.model

Classes in org.girod.jgraphml.model that implement Graph

Modifier and Type	Class and Description
class	AbstractGraphMLDiagram An abstract graphml diagram.
class	GraphMLDiagram A graphml diagram.