Package  Description 

org.jgrapht.alg.connectivity 
Algorithms dealing with various connectivity aspects of a graph.

org.jgrapht.graph 
Implementations of various graphs.

org.jgrapht.opt.graph.fastutil 
Specialized graph implementations using the FastUtil library

Modifier and Type  Class and Description 

class 
BlockCutpointGraph<V,E>
A BlockCutpoint graph (also known as a blockcut tree).

Modifier and Type  Class and Description 

class 
DefaultDirectedGraph<V,E>
The default implementation of a directed graph.

class 
DefaultDirectedWeightedGraph<V,E>
The default implementation of a directed weighted graph.

class 
DefaultUndirectedGraph<V,E>
The default implementation of an undirected graph.

class 
DefaultUndirectedWeightedGraph<V,E>
The default implementation of an undirected 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>
Implementation of 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  Class and Description 

class 
FastutilMapGraph<V,E>
A graph implementation using fastutil's map implementations for storage.

class 
FastutilMapIntVertexGraph<E>
A graph implementation using fastutil's map implementations for storage specialized
for integer vertices.

Copyright © 2019. All rights reserved.