| Package | Description |
|---|---|
| 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.
|
| 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 |
KPartiteGraph<V,E>
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.
|
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. |
| Modifier and Type | Class and Description |
|---|---|
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
|
| Modifier and Type | Field and Description |
|---|---|
protected Graph<V,E> |
GraphDecorator.delegate |
| 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. |
| Modifier and Type | Field and Description |
|---|---|
protected Graph<V,E> |
GraphEvent.source |
| Modifier and Type | Method and Description |
|---|---|
Graph<V,E> |
GraphEvent.getSource() |
| 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.
|
| Modifier and Type | Field and Description |
|---|---|
protected Map<Context<Graph<V,E>,E>,Integer> |
DefaultParallelEdgeIndexFunction.edge_index |
| 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.
|
| Modifier and Type | Method and Description |
|---|---|
int |
IncidentEdgeIndexFunction.getIndex(Graph<V,E> graph,
E e)
Returns the index for the specified edge.
|
int |
EdgeIndexFunction.getIndex(Graph<V,E> graph,
E e)
Returns
e's index in graph. |
int |
DefaultParallelEdgeIndexFunction.getIndex(Graph<V,E> graph,
E e)
Returns the index for
e in graph. |
protected int |
IncidentEdgeIndexFunction.getIndex(Graph<V,E> graph,
E e,
V v) |
protected int |
DefaultParallelEdgeIndexFunction.getIndex(Graph<V,E> graph,
E e,
V v) |
protected int |
IncidentEdgeIndexFunction.getIndex(Graph<V,E> graph,
E e,
V u,
V v) |
protected int |
DefaultParallelEdgeIndexFunction.getIndex(Graph<V,E> graph,
E e,
V v,
V u) |
void |
IncidentEdgeIndexFunction.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 |
DefaultParallelEdgeIndexFunction.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.
|
Copyright © 2016. All rights reserved.