|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use AbstractGraph | |
---|---|
org.jgrapht.alg | Algorithms provided with JGraphT. |
org.jgrapht.experimental | A package that contains experimental work or work-in-progress that is not yet ready to be included in a release. |
org.jgrapht.experimental.dag | |
org.jgrapht.graph | Implementations of various graphs. |
Uses of AbstractGraph in org.jgrapht.alg |
---|
Subclasses of AbstractGraph in org.jgrapht.alg | |
---|---|
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 AbstractGraph in org.jgrapht.experimental |
---|
Subclasses of AbstractGraph in org.jgrapht.experimental | |
---|---|
class |
GraphSquare<V,E>
DOCUMENT ME! |
Uses of AbstractGraph in org.jgrapht.experimental.dag |
---|
Subclasses of AbstractGraph in org.jgrapht.experimental.dag | |
---|---|
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 AbstractGraph in org.jgrapht.graph |
---|
Subclasses of AbstractGraph in org.jgrapht.graph | |
---|---|
class |
AbstractBaseGraph<V,E>
The most general implementation of the Graph interface. |
class |
AsUndirectedGraph<V,E>
An undirected view of the backing directed graph specified in the constructor. |
class |
AsUnweightedDirectedGraph<V,E>
An unweighted view of the backing weighted graph specified in the constructor. |
class |
AsUnweightedGraph<V,E>
An unweighted view of the backing weighted graph specified in the constructor. |
class |
AsWeightedGraph<V,E>
A weighted view of the backing graph specified in the constructor. |
class |
DefaultDirectedGraph<V,E>
A directed graph. |
class |
DefaultDirectedWeightedGraph<V,E>
A directed weighted graph. |
class |
DefaultListenableGraph<V,E>
A graph backed by the the graph specified at the constructor, which can be listened by GraphListener s and by
VertexSetListener s. |
class |
DirectedGraphUnion<V,E>
|
class |
DirectedMaskSubgraph<V,E>
A directed graph that is a MaskSubgraph on another graph. |
class |
DirectedMultigraph<V,E>
A directed multigraph. |
class |
DirectedPseudograph<V,E>
A directed pseudograph. |
class |
DirectedSubgraph<V,E>
A directed graph that is a subgraph on other graph. |
class |
DirectedWeightedMultigraph<V,E>
A directed weighted multigraph. |
class |
DirectedWeightedPseudograph<V,E>
A directed weighted pseudograph. |
class |
DirectedWeightedSubgraph<V,E>
A directed weighted graph that is a subgraph on other graph. |
class |
EdgeReversedGraph<V,E>
Provides an edge-reversed view g' of a directed graph g. |
class |
GraphDelegator<V,E>
A graph backed by the the graph specified at the constructor, which delegates all its methods to the backing graph. |
class |
GraphUnion<V,E,G extends Graph<V,E>>
Read-only union of two graphs: G1 and G2. |
class |
ListenableDirectedGraph<V,E>
A directed graph which is also ListenableGraph . |
class |
ListenableDirectedWeightedGraph<V,E>
A directed weighted graph which is also ListenableGraph . |
class |
ListenableUndirectedGraph<V,E>
An undirected graph which is also ListenableGraph . |
class |
ListenableUndirectedWeightedGraph<V,E>
An undirected weighted graph which is also ListenableGraph . |
class |
MaskSubgraph<V,E>
An unmodifiable subgraph induced by a vertex/edge masking function. |
class |
Multigraph<V,E>
A multigraph. |
class |
ParanoidGraph<V,E>
ParanoidGraph provides a way to verify that objects added to a graph obey the standard equals/hashCode contract. |
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 |
Subgraph<V,E,G extends Graph<V,E>>
A subgraph is a graph that has a subset of vertices and a subset of edges with respect to some base graph. |
class |
UndirectedGraphUnion<V,E>
|
class |
UndirectedMaskSubgraph<V,E>
An undirected graph that is a MaskSubgraph on another graph. |
class |
UndirectedSubgraph<V,E>
An undirected graph that is a subgraph on other graph. |
class |
UndirectedWeightedSubgraph<V,E>
An undirected weighted graph that is a subgraph on other graph. |
class |
UnmodifiableDirectedGraph<V,E>
A directed graph that cannot be modified. |
class |
UnmodifiableGraph<V,E>
An unmodifiable view of the backing graph specified in the constructor. |
class |
UnmodifiableUndirectedGraph<V,E>
An undirected graph that cannot be modified. |
class |
WeightedMultigraph<V,E>
A weighted multigraph. |
class |
WeightedPseudograph<V,E>
A weighted pseudograph. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |