| 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.algorithms.scoring |
Contains scoring 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.
|
| Class and Description |
|---|
| Forest
An interface for a graph which consists of a collection of rooted
directed acyclic graphs.
|
| Graph
A graph consisting of a set of vertices of type
V
set and a set of edges of type E. |
| Class and Description |
|---|
| Graph
A graph consisting of a set of vertices of type
V
set and a set of edges of type E. |
| Hypergraph
A hypergraph, consisting of a set of vertices of type
V and a set of hyperedges of type E which
connect the vertices. |
| Class and Description |
|---|
| Hypergraph
A hypergraph, consisting of a set of vertices of type
V and a set of hyperedges of type E which
connect the vertices. |
| Class and Description |
|---|
| AbstractGraph
Abstract implementation of the
Graph interface. |
| AbstractTypedGraph
An abstract class for graphs whose edges all have the same
EdgeType. |
| DirectedGraph
A tagging interface for implementations of
Graph
that accept only directed edges. |
| DirectedSparseMultigraph
An implementation of
DirectedGraph, suitable for sparse graphs,
that permits parallel edges. |
| Forest
An interface for a graph which consists of a collection of rooted
directed acyclic graphs.
|
| Graph
A graph consisting of a set of vertices of type
V
set and a set of edges of type E. |
| GraphDecorator
An implementation of
Graph that delegates its method calls to a
constructor-specified Graph instance. |
| Hypergraph
A hypergraph, consisting of a set of vertices of type
V and a set of hyperedges of type E which
connect the vertices. |
| MultiGraph
A tagging interface which indicates that the implementing graph accepts
parallel edges.
|
| OrderedKAryTree.VertexData |
| OrderedSparseMultigraph
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. |
| SparseMultigraph
An implementation of
Graph that is suitable for sparse graphs
and permits directed, undirected, and parallel edges. |
| Tree
A subtype of
Graph which is a (directed, rooted) tree. |
| UndirectedGraph
A tagging interface for extensions of
Graph that
accept only undirected edges. |
| UndirectedSparseMultigraph
An implementation of
UndirectedGraph that is suitable for
sparse graphs and permits parallel edges. |
| Class and Description |
|---|
| Graph
A graph consisting of a set of vertices of type
V
set and a set of edges of type E. |
| Class and Description |
|---|
| DirectedGraph
A tagging interface for implementations of
Graph
that accept only directed edges. |
| Forest
An interface for a graph which consists of a collection of rooted
directed acyclic graphs.
|
| Graph
A graph consisting of a set of vertices of type
V
set and a set of edges of type E. |
| Tree
A subtype of
Graph which is a (directed, rooted) tree. |
| UndirectedGraph
A tagging interface for extensions of
Graph that
accept only undirected edges. |
| Class and Description |
|---|
| AbstractGraph
Abstract implementation of the
Graph interface. |
| Graph
A graph consisting of a set of vertices of type
V
set and a set of edges of type E. |
| Hypergraph
A hypergraph, consisting of a set of vertices of type
V and a set of hyperedges of type E which
connect the vertices. |
Copyright © 2021, 2022 Herve Girod. All Rights Reserved. Documentation and source under the BSD 3-Clause licence