Package  Description 

org.jgrapht  
org.jgrapht.alg 
Algorithms provided with JGraphT.

org.jgrapht.alg.cycle 
Algorithms for enumeration of simple cycles in graphs.

org.jgrapht.alg.interfaces 
Algorithm related interfaces.

org.jgrapht.alg.spanning 
Spanning tree and spanner algorithms.

org.jgrapht.alg.util 
Utilities used by JGraphT algorithms.

org.jgrapht.alg.vertexcover 
Vertex cover algorithms.

org.jgrapht.graph 
Implementations of various graphs.

org.jgrapht.graph.builder 
Various builder for graphs.

Modifier and Type  Method and Description 

static <V,E> UndirectedGraph<V,E> 
Graphs.undirectedGraph(Graph<V,E> g)
Returns an undirected view of the specified graph.

Modifier and Type  Method and Description 

static <V,E> boolean 
GraphTests.isConnected(UndirectedGraph<V,E> graph)
Test whether an undirected graph is connected.

static <V,E> boolean 
GraphTests.isTree(UndirectedGraph<V,E> graph)
Test whether an undirected graph is a tree.

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 StructureBased Resilience Metrics for ServiceOriented Networks: Definition 4.5 Let G(V; E) be a connected undirected graph. 
Modifier and Type  Method and Description 

UndirectedGraph<V,E> 
BlockCutpointGraph.getBlock(V vertex)
Returns the vertex if vertex is a cutpoint, and otherwise returns the block (biconnected
component) containing the vertex.

UndirectedGraph<V,E> 
CliqueMinimalSeparatorDecomposition.getGraph()
Get the original graph.

UndirectedGraph<V,E> 
CliqueMinimalSeparatorDecomposition.getMinimalTriangulation()
Get the minimal triangulation of the graph.

Modifier and Type  Method and Description 

static <V,E> int 
ChromaticNumber.findGreedyChromaticNumber(UndirectedGraph<V,E> g)
Finds the number of colors required for a greedy coloring of the graph.

static <V,E> Map<Integer,Set<V>> 
ChromaticNumber.findGreedyColoredGroups(UndirectedGraph<V,E> g)
Finds a greedy coloring of the graph.

static <V,E> List<V> 
EulerianCircuit.getEulerianCircuitVertices(UndirectedGraph<V,E> g)
Deprecated.
This method will return a list of vertices which represents the Eulerian circuit of the
graph.

static <V,E> boolean 
EulerianCircuit.isEulerian(UndirectedGraph<V,E> graph)
Deprecated.
Test whether a graph is Eulerian.

Constructor and Description 

BiconnectivityInspector(UndirectedGraph<V,E> graph)
Running time = O(m) where m is the number of edges.

BlockCutpointGraph(UndirectedGraph<V,E> graph)
Running time = O(m) where m is the number of edges.

CliqueMinimalSeparatorDecomposition(UndirectedGraph<V,E> g)
Setup a clique minimal separator decomposition on undirected graph
g . 
ConnectivityInspector(UndirectedGraph<V,E> g)
Creates a connectivity inspector for the specified undirected graph.

EdmondsBlossomShrinking(UndirectedGraph<V,E> G)
Deprecated.
Construct an instance of the Edmonds blossom shrinking algorithm.

GreedyMultiplicativeSpanner(UndirectedGraph<V,E> graph,
int k)
Deprecated.
Constructs instance to compute a (2k1)spanner of a graph.

HopcroftKarpBipartiteMatching(UndirectedGraph<V,E> graph,
Set<V> partition1,
Set<V> partition2)
Deprecated.
Create a new instance of the HopcroftKarp algorithm for the computation of maximum matchings
in bipartite graphs.

StoerWagnerMinimumCut(UndirectedGraph<V,E> graph)
Will compute the minimum cut in graph.

Modifier and Type  Method and Description 

UndirectedGraph<V,E> 
UndirectedCycleBase.getGraph()
Returns the graph on which the cycle base search algorithm is executed by this object.

UndirectedGraph<V,E> 
PatonCycleBase.getGraph()
Returns the graph on which the cycle base search algorithm is executed by this object.

Modifier and Type  Method and Description 

void 
UndirectedCycleBase.setGraph(UndirectedGraph<V,E> graph)
Sets the graph on which the cycle base search algorithm is executed by this object.

void 
PatonCycleBase.setGraph(UndirectedGraph<V,E> graph)
Sets the graph on which the cycle base search algorithm is executed by this object.

Constructor and Description 

PatonCycleBase(UndirectedGraph<V,E> graph)
Create a cycle base finder for the specified graph.

Modifier and Type  Method and Description 

MinimumVertexCoverAlgorithm.VertexCover<V> 
MinimumVertexCoverAlgorithm.getVertexCover(UndirectedGraph<V,E> graph)
Computes a vertex cover; all vertices are considered to have equal weight.

default MinimumVertexCoverAlgorithm.VertexCover<V> 
MinimumWeightedVertexCoverAlgorithm.getVertexCover(UndirectedGraph<V,E> graph)
Computes a vertex cover; all vertices are considered to have equal weight.

MinimumVertexCoverAlgorithm.VertexCover<V> 
MinimumWeightedVertexCoverAlgorithm.getVertexCover(UndirectedGraph<V,E> graph,
Map<V,Double> vertexWeightMap)
Computes a vertex cover; the weight of each vertex is provided in the in the
vertexWeightMap . 
Constructor and Description 

GreedyMultiplicativeSpanner(UndirectedGraph<V,E> graph,
int k)
Constructs instance to compute a (2k1)spanner of an undirected graph.

Constructor and Description 

VertexDegreeComparator(UndirectedGraph<V,E> g)
Creates a comparator for comparing the degrees of vertices in the specified graph.

VertexDegreeComparator(UndirectedGraph<V,E> g,
VertexDegreeComparator.Order order)
Creates a comparator for comparing the degrees of vertices in the specified graph.

Modifier and Type  Method and Description 

MinimumVertexCoverAlgorithm.VertexCover<V> 
RecursiveExactVCImpl.getVertexCover(UndirectedGraph<V,E> graph) 
MinimumVertexCoverAlgorithm.VertexCover<V> 
EdgeBasedTwoApproxVCImpl.getVertexCover(UndirectedGraph<V,E> graph)
Finds a 2approximation for a minimal vertex cover of the specified graph.

MinimumVertexCoverAlgorithm.VertexCover<V> 
RecursiveExactVCImpl.getVertexCover(UndirectedGraph<V,E> graph,
Map<V,Double> vertexWeightMap) 
MinimumVertexCoverAlgorithm.VertexCover<V> 
GreedyVCImpl.getVertexCover(UndirectedGraph<V,E> graph,
Map<V,Double> vertexWeightMap)
Finds a greedy solution to the minimum weighted vertex cover problem.

MinimumVertexCoverAlgorithm.VertexCover<V> 
ClarksonTwoApproxVCImpl.getVertexCover(UndirectedGraph<V,E> graph,
Map<V,Double> vertexWeightMap) 
MinimumVertexCoverAlgorithm.VertexCover<V> 
BarYehudaEvenTwoApproxVCImpl.getVertexCover(UndirectedGraph<V,E> graph,
Map<V,Double> vertexWeightMap) 
Modifier and Type  Class and Description 

class 
AsUndirectedGraph<V,E>
An undirected view of the backing directed graph specified in the constructor.

class 
ListenableUndirectedGraph<V,E>
An undirected graph which is also
ListenableGraph . 
class 
ListenableUndirectedWeightedGraph<V,E>
An undirected weighted graph which is also
ListenableGraph . 
class 
Multigraph<V,E>
A multigraph.

class 
Pseudograph<V,E>
A pseudograph.

class 
SimpleGraph<V,E>
A simple graph.

class 
SimpleWeightedGraph<V,E>
A simple weighted graph.

class 
UndirectedGraphUnion<V,E>
An undirected version of the readonly union of two graphs.

class 
UndirectedMaskSubgraph<V,E>
An undirected graph that is a
MaskSubgraph of another graph. 
class 
UndirectedSubgraph<V,E>
An undirected graph that is a subgraph of another graph.

class 
UndirectedWeightedSubgraph<V,E>
An undirected weighted graph that is a subgraph on other graph.

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.

Constructor and Description 

ListenableUndirectedGraph(UndirectedGraph<V,E> base)
Creates a new listenable undirected graph.

MixedGraphUnion(UndirectedGraph<V,E> g1,
DirectedGraph<V,E> g2)
Construct a new graph union.

MixedGraphUnion(UndirectedGraph<V,E> g1,
DirectedGraph<V,E> g2,
WeightCombiner operator)
Construct a new graph union.

UndirectedMaskSubgraph(UndirectedGraph<V,E> base,
MaskFunctor<V,E> mask)
Deprecated.
in favor of using lambdas

UndirectedMaskSubgraph(UndirectedGraph<V,E> base,
java.util.function.Predicate<V> vertexMask,
java.util.function.Predicate<E> edgeMask)
Create a new undirected
MaskSubgraph of another graph. 
UndirectedSubgraph(UndirectedGraph<V,E> base)
Creates a new undirected induced subgraph with all vertices included.

UndirectedSubgraph(UndirectedGraph<V,E> base,
Set<? extends V> vertexSubset)
Creates a new undirected induced subgraph.

UndirectedSubgraph(UndirectedGraph<V,E> base,
Set<? extends V> vertexSubset,
Set<? extends E> edgeSubset)
Creates a new undirected subgraph.

UnmodifiableUndirectedGraph(UndirectedGraph<V,E> g)
Creates a new unmodifiable undirected graph based on the specified backing graph.

Modifier and Type  Class and Description 

class 
UndirectedGraphBuilder<V,E,G extends UndirectedGraph<V,E>>
A builder class for
Graph . 
class 
UndirectedGraphBuilderBase<V,E,G extends UndirectedGraph<V,E>,B extends UndirectedGraphBuilderBase<V,E,G,B>>
Base class for
UndirectedGraphBuilder for extending. 
class 
UndirectedWeightedGraphBuilder<V,E,G extends UndirectedGraph<V,E> & WeightedGraph<V,E>>
A builder class for undirected weighted graphs.

class 
UndirectedWeightedGraphBuilderBase<V,E,G extends UndirectedGraph<V,E> & WeightedGraph<V,E>,B extends UndirectedWeightedGraphBuilderBase<V,E,G,B>>
Base class for
UndirectedWeightedGraphBuilder for extending. 
Copyright © 2017. All rights reserved.