Uses of Class
edu.uci.ics.jung.graph.AbstractGraph

Packages that use AbstractGraph

Package	Description
edu.uci.ics.jung.graph	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.graph

Modifier and Type	Class	Description
class	AbstractTypedGraph<V,E>	An abstract class for graphs whose edges all have the same EdgeType.
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	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.