Name | Description | Type | Package | Framework |
AbstractGraph | Abstract implementation of the Graph interface. | Class | edu.uci.ics.jung.graph | SourceForge Jung |
|
AbstractTypedGraph | An abstract class for graphs whose edges all have the same EdgeType. | Class | edu.uci.ics.jung.graph | SourceForge Jung |
|
Context | A class that is used to link together a graph element and a specific graph. | Class | edu.uci.ics.jung.graph.util | SourceForge Jung |
|
DefaultParallelEdgeIndexFunction | A class which creates and maintains indices for parallel edges. | Class | edu.uci.ics.jung.graph.util | SourceForge Jung |
|
DelegateForest | An implementation of Forest that delegates to a specified DirectedGraphAuthor:Tom NelsonSee Also:Serialized Form | Class | edu.uci.ics.jung.graph | SourceForge Jung |
|
DelegateTree | An implementation of Tree that delegates to a specified instance of DirectedGraph. | Class | edu.uci.ics.jung.graph | SourceForge Jung |
|
DirectedGraph | A tagging interface for implementations of Graph that accept only directed edges. | Interface | edu.uci.ics.jung.graph | SourceForge Jung |
|
DirectedOrderedSparseMultigraph | An implementation of DirectedGraph, suitable for sparse graphs, that orders its vertex and edge collections | Class | edu.uci.ics.jung.graph | SourceForge Jung |
|
DirectedSparseGraph | An implementation of DirectedGraph suitable for sparse graphs. | Class | edu.uci.ics.jung.graph | SourceForge Jung |
|
DirectedSparseMultigraph | An implementation of DirectedGraph, suitable for sparse graphs, that permits parallel edges. | Class | edu.uci.ics.jung.graph | SourceForge Jung |
|
EdgeIndexFunction | 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. | Interface | edu.uci.ics.jung.graph.util | SourceForge Jung |
|
EdgeType | enum EdgeTypeextends EnumDefines the possible edge types for graphs which assign types to edges. | Class | edu.uci.ics.jung.graph.util | SourceForge Jung |
|
Forest | An interface for a graph which consists of a collection of rooted directed acyclic graphs. | Interface | edu.uci.ics.jung.graph | SourceForge Jung |
|
Graph | A graph consisting of a set of vertices of type V set and a set of edges of type E. | Interface | edu.uci.ics.jung.graph | SourceForge Jung |
|
GraphDecorator | An implementation of Graph that delegates its method calls to a constructor-specified Graph instance. | Class | edu.uci.ics.jung.graph | SourceForge Jung |
|
GraphEvent | | Class | edu.uci.ics.jung.graph.event | SourceForge Jung |
|
GraphEvent .Edge | An event type pertaining to graph edges. | Class | edu.uci.ics.jung.graph.event.GraphEvent | SourceForge Jung |
|
GraphEvent .Type | Types of graph events. | Class | edu.uci.ics.jung.graph.event.GraphEvent | SourceForge Jung |
|
GraphEvent .Vertex | An event type pertaining to graph vertices. | Class | edu.uci.ics.jung.graph.event.GraphEvent | SourceForge Jung |
|
GraphEventListener | An interface for classes that listen for graph events. | Interface | edu.uci.ics.jung.graph.event | SourceForge Jung |
|
Graphs | Provides specialized implementations of GraphDecorator. | Class | edu.uci.ics.jung.graph.util | SourceForge Jung |
|
Hypergraph | A hypergraph, consisting of a set of vertices of type V and a set of hyperedges of type E which connect the vertices. | Interface | edu.uci.ics.jung.graph | SourceForge Jung |
|
IncidentEdgeIndexFunction | A class which creates and maintains indices for incident edges. | Class | edu.uci.ics.jung.graph.util | SourceForge Jung |
|
KPartiteGraph | 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 | Interface | edu.uci.ics.jung.graph | SourceForge Jung |
|
ObservableGraph | A decorator class for graphs which generates eventsAuthor:Joshua O'Madadhain | Class | edu.uci.ics.jung.graph | SourceForge Jung |
|
OrderedKAryTree | | Class | edu.uci.ics.jung.graph | SourceForge Jung |
|
OrderedSparseMultigraph | An implementation of Graph that orders its vertex and edge collections according to insertion time, is suitable for sparse graphs, and | Class | edu.uci.ics.jung.graph | SourceForge Jung |
|
Pair | An implementation of Collection that stores exactly 2 non-null objects and is not mutable. | Class | edu.uci.ics.jung.graph.util | SourceForge Jung |
|
SetHypergraph | An implementation of Hypergraph that is suitable for sparse graphs and permits parallel edges. | Class | edu.uci.ics.jung.graph | SourceForge Jung |
|
SortedSparseMultigraph | An implementation of Graph that is suitable for sparse graphs, orders its vertex and edge collections according to either specified Comparator | Class | edu.uci.ics.jung.graph | SourceForge Jung |
|
SparseGraph | An implementation of Graph that is suitable for sparse graphs and permits both directed and undirected edges. | Class | edu.uci.ics.jung.graph | SourceForge Jung |
|
SparseMultigraph | An implementation of Graph that is suitable for sparse graphs and permits directed, undirected, and parallel edges. | Class | edu.uci.ics.jung.graph | SourceForge Jung |
|
TestGraphs | Provides generators for several different test graphs. | Class | edu.uci.ics.jung.graph.util | SourceForge Jung |
|
Tree | A subtype of Graph which is a (directed, rooted) tree. | Class | edu.uci.ics.jung.graph | SourceForge Jung |
|
TreeUtils | Contains static methods for operating on instances of Tree. | Class | edu.uci.ics.jung.graph.util | SourceForge Jung |
|
UndirectedGraph | A tagging interface for extensions of Graph that accept only undirected edges. | Interface | edu.uci.ics.jung.graph | SourceForge Jung |
|
UndirectedOrderedSparseMultigraph | An implementation of UndirectedGraph that is suitable for sparse graphs, orders its vertex and edge collections according to insertion time, and permits | Class | edu.uci.ics.jung.graph | SourceForge Jung |
|
UndirectedSparseGraph | An implementation of UndirectedGraph that is suitableSee Also:Serialized Form | Class | edu.uci.ics.jung.graph | SourceForge Jung |
|
UndirectedSparseMultigraph | An implementation of UndirectedGraph that is suitable for sparse graphs and permits parallel edges. | Class | edu.uci.ics.jung.graph | SourceForge Jung |