Uses of Class
org.jgrapht.graph.AbstractBaseGraph
Package
Description
Algorithms dealing with various connectivity aspects of a graph.
Implementations of various graphs.
Specialized graph implementations using the FastUtil library
-
Uses of AbstractBaseGraph in org.jgrapht.alg.connectivity
Modifier and TypeClassDescriptionclass
BlockCutpointGraph<V,
E> A Block-Cutpoint graph (also known as a block-cut tree). -
Uses of AbstractBaseGraph in org.jgrapht.graph
Modifier and TypeClassDescriptionclass
DefaultDirectedGraph<V,
E> The default implementation of a directed graph.class
The default implementation of a directed weighted graph.class
The default implementation of an undirected graph.class
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
A directed weighted multigraph.class
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
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. -
Uses of AbstractBaseGraph in org.jgrapht.opt.graph.fastutil
Modifier and TypeClassDescriptionclass
FastutilMapGraph<V,
E> A graph implementation using fastutil's map implementations for storage.class
A graph implementation using fastutil's map implementations for storage specialized for integer vertices.