Package | Description |
---|---|
org.jgrapht.alg |
Algorithms provided with JGraphT.
|
org.jgrapht.graph |
Implementations of various graphs.
|
org.jgrapht.graph.specifics |
Implementations of specifics for various graph types.
|
Modifier and Type | Class and 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. |
Modifier and Type | Class and Description |
---|---|
class |
DefaultDirectedGraph<V,E>
A directed graph.
|
class |
DefaultDirectedWeightedGraph<V,E>
A directed weighted graph.
|
class |
DirectedAcyclicGraph<V,E>
A directed acyclic graph (DAG).
|
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.
|
Modifier and Type | Field and Description |
---|---|
protected AbstractBaseGraph<V,E> |
UndirectedSpecifics.abstractBaseGraph |
protected AbstractBaseGraph<V,E> |
DirectedSpecifics.abstractBaseGraph |
Constructor and Description |
---|
DirectedSpecifics(AbstractBaseGraph<V,E> abstractBaseGraph)
Construct a new directed specifics.
|
DirectedSpecifics(AbstractBaseGraph<V,E> abstractBaseGraph,
Map<V,DirectedEdgeContainer<V,E>> vertexMap)
Construct a new directed specifics.
|
DirectedSpecifics(AbstractBaseGraph<V,E> abstractBaseGraph,
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,
Map<V,DirectedEdgeContainer<V,E>> vertexMap)
Construct a new fast lookup directed specifics.
|
FastLookupDirectedSpecifics(AbstractBaseGraph<V,E> abstractBaseGraph,
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,
Map<V,UndirectedEdgeContainer<V,E>> vertexMap)
Construct a new fast lookup undirected specifics.
|
FastLookupUndirectedSpecifics(AbstractBaseGraph<V,E> abstractBaseGraph,
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,
Map<V,UndirectedEdgeContainer<V,E>> vertexMap)
Construct a new undirected specifics.
|
UndirectedSpecifics(AbstractBaseGraph<V,E> abstractBaseGraph,
Map<V,UndirectedEdgeContainer<V,E>> vertexMap,
EdgeSetFactory<V,E> edgeSetFactory)
Construct a new undirected specifics.
|
Copyright © 2017. All rights reserved.