Uses of Class
edu.uci.ics.jung.graph.impl.AbstractSparseGraph

Packages that use AbstractSparseGraph

edu.uci.ics.jung.graph.impl	Implementations of the JUNG vertex, edge, and graph interfaces.
edu.uci.ics.jung.utils	Provides a series of useful utility methods, and a number of custom helper classes designed specifically for this application.

Uses of AbstractSparseGraph in edu.uci.ics.jung.graph.impl

Subclasses of AbstractSparseGraph in edu.uci.ics.jung.graph.impl

class	BipartiteGraph A Bipartite graph is divided into A vertices and B vertices.
class	DirectedSparseGraph An implementation of Graph that consists of a Vertex set and a DirectedEdge set.
class	KPartiteSparseGraph An implementation of KPartiteGraph based on SparseGraph.
class	SparseGraph An implementation of AbstractSparseGraph that, by default, imposes no constraints on the edges and vertices that may be added to it.
class	SparseTree An implementation of Graph that consists of a Vertex set and a DirectedEdge set.
class	UndirectedSparseGraph An implementation of Graph that consists of a Vertex set and an UndirectedEdge set.

Uses of AbstractSparseGraph in edu.uci.ics.jung.utils

Methods in edu.uci.ics.jung.utils that return AbstractSparseGraph

static AbstractSparseGraph

TestGraphs.createTestGraph(boolean isDirected) Creates a small sample graph that can be used for testing purposes.