Uses of Class
org.jgrapht.graph.AbstractBaseGraph

Packages that use AbstractBaseGraph

Package	Description
org.jgrapht.alg	Algorithms provided with JGraphT.
org.jgrapht.experimental	Experimental work or work-in-progress.
org.jgrapht.experimental.dag	Experimental package with directed acyclic graphs.
org.jgrapht.graph	Implementations of various graphs.
org.jgrapht.graph.specifics	Implementations of specifics for various graph types.

Uses of AbstractBaseGraph in org.jgrapht.alg

Subclasses of AbstractBaseGraph in org.jgrapht.alg

Modifier and Type	Class	Description
class	BlockCutpointGraph<V,E>	Definition of a block of a graph in MathWorld. Definition and lemma taken from the article Structure-Based Resilience Metrics for Service-Oriented Networks: Definition 4.5 Let G(V; E) be a connected undirected graph.

Uses of AbstractBaseGraph in org.jgrapht.experimental

Subclasses of AbstractBaseGraph in org.jgrapht.experimental

Modifier and Type	Class	Description
class	GraphSquare<V,E>	A unmodifiable graph which is the squared graph of another.

Uses of AbstractBaseGraph in org.jgrapht.experimental.dag

Subclasses of AbstractBaseGraph in org.jgrapht.experimental.dag

Modifier and Type	Class	Description
class	DirectedAcyclicGraph<V,E>	DirectedAcyclicGraph implements a DAG that can be modified (vertices & edges added and removed), is guaranteed to remain acyclic, and provides fast topological order iteration.

Uses of AbstractBaseGraph in org.jgrapht.graph

Subclasses of AbstractBaseGraph in org.jgrapht.graph

Modifier and Type	Class	Description
class	DefaultDirectedGraph<V,E>	A directed graph.
class	DefaultDirectedWeightedGraph<V,E>	A directed weighted graph.
class	DirectedMultigraph<V,E>	A directed multigraph.
class	DirectedPseudograph<V,E>	A directed pseudograph.
class	DirectedWeightedMultigraph<V,E>	A directed weighted multigraph.
class	DirectedWeightedPseudograph<V,E>	A directed weighted pseudograph.
class	Multigraph<V,E>	A multigraph.
class	Pseudograph<V,E>	A pseudograph.
class	SimpleDirectedGraph<V,E>	A simple directed graph.
class	SimpleDirectedWeightedGraph<V,E>	A simple directed weighted graph.
class	SimpleGraph<V,E>	A simple graph.
class	SimpleWeightedGraph<V,E>	A simple weighted graph.
class	WeightedMultigraph<V,E>	A weighted multigraph.
class	WeightedPseudograph<V,E>	A weighted pseudograph.

Uses of AbstractBaseGraph in org.jgrapht.graph.specifics

Fields in org.jgrapht.graph.specifics declared as AbstractBaseGraph

Modifier and Type	Field	Description
protected AbstractBaseGraph<V,E>	DirectedSpecifics.abstractBaseGraph
protected AbstractBaseGraph<V,E>	UndirectedSpecifics.abstractBaseGraph

Constructors in org.jgrapht.graph.specifics with parameters of type AbstractBaseGraph

Constructor	Description
DirectedSpecifics(AbstractBaseGraph<V,E> abstractBaseGraph)	Construct a new directed specifics.
DirectedSpecifics(AbstractBaseGraph<V,E> abstractBaseGraph, java.util.Map<V,DirectedEdgeContainer<V,E>> vertexMap)	Construct a new directed specifics.
DirectedSpecifics(AbstractBaseGraph<V,E> abstractBaseGraph, java.util.Map<V,DirectedEdgeContainer<V,E>> vertexMap, EdgeSetFactory<V,E> edgeSetFactory)	Construct a new directed specifics.
FastLookupDirectedSpecifics(AbstractBaseGraph<V,E> abstractBaseGraph)	Construct a new fast lookup directed specifics.
FastLookupDirectedSpecifics(AbstractBaseGraph<V,E> abstractBaseGraph, java.util.Map<V,DirectedEdgeContainer<V,E>> vertexMap)	Construct a new fast lookup directed specifics.
FastLookupDirectedSpecifics(AbstractBaseGraph<V,E> abstractBaseGraph, java.util.Map<V,DirectedEdgeContainer<V,E>> vertexMap, EdgeSetFactory<V,E> edgeSetFactory)	Construct a new fast lookup directed specifics.
FastLookupUndirectedSpecifics(AbstractBaseGraph<V,E> abstractBaseGraph)	Construct a new fast lookup undirected specifics.
FastLookupUndirectedSpecifics(AbstractBaseGraph<V,E> abstractBaseGraph, java.util.Map<V,UndirectedEdgeContainer<V,E>> vertexMap)	Construct a new fast lookup undirected specifics.
FastLookupUndirectedSpecifics(AbstractBaseGraph<V,E> abstractBaseGraph, java.util.Map<V,UndirectedEdgeContainer<V,E>> vertexMap, EdgeSetFactory<V,E> edgeSetFactory)	Construct a new fast lookup undirected specifics.
UndirectedSpecifics(AbstractBaseGraph<V,E> abstractBaseGraph)	Construct a new undirected specifics.
UndirectedSpecifics(AbstractBaseGraph<V,E> abstractBaseGraph, java.util.Map<V,UndirectedEdgeContainer<V,E>> vertexMap)	Construct a new undirected specifics.
UndirectedSpecifics(AbstractBaseGraph<V,E> abstractBaseGraph, java.util.Map<V,UndirectedEdgeContainer<V,E>> vertexMap, EdgeSetFactory<V,E> edgeSetFactory)	Construct a new undirected specifics.