Uses of Class
edu.uci.ics.jung.graph.AbstractGraph
Packages that use AbstractGraph
Package
Description
Interfaces for the JUNG graph types, and some representative implementations.
-
Uses of AbstractGraph in edu.uci.ics.jung.graph
Subclasses of AbstractGraph in edu.uci.ics.jung.graphModifier and TypeClassDescriptionclass
AbstractTypedGraph<V,
E> An abstract class for graphs whose edges all have the sameEdgeType
.class
An implementation ofDirectedGraph
, suitable for sparse graphs, that orders its vertex and edge collections according to insertion time.class
DirectedSparseGraph<V,
E> An implementation ofDirectedGraph
suitable for sparse graphs.class
An implementation ofDirectedGraph
, suitable for sparse graphs, that permits parallel edges.class
OrderedKAryTree<V,
E> An implementation ofTree
in which each vertex has ≤ k children.class
An implementation ofGraph
that orders its vertex and edge collections according to insertion time, is suitable for sparse graphs, and permits directed, undirected, and parallel edges.class
An implementation ofGraph
that is suitable for sparse graphs, orders its vertex and edge collections according to either specifiedComparator
instances or the natural ordering of their elements, and permits directed, undirected, and parallel edges.class
SparseGraph<V,
E> An implementation ofGraph
that is suitable for sparse graphs and permits both directed and undirected edges.class
SparseMultigraph<V,
E> An implementation ofGraph
that is suitable for sparse graphs and permits directed, undirected, and parallel edges.class
An implementation ofUndirectedGraph
that is suitable for sparse graphs, orders its vertex and edge collections according to insertion time, and permits parallel edges.class
An implementation ofUndirectedGraph
that is suitable for sparse graphs.class
An implementation ofUndirectedGraph
that is suitable for sparse graphs and permits parallel edges.