Module org.jgrapht.core
Package org.jgrapht.alg.interfaces
package org.jgrapht.alg.interfaces
Algorithm related interfaces.

ClassDescriptionInterface for an admissible heuristic used in A* search.An algorithm which computes a capacitated (minimum) spanning tree of a given connected graph with a designated root vertex.A spanning tree.Default implementation of the spanning tree interface.Algorithm to compute a (weighted) Clique in a graph.A CliqueDefault implementation of a (weighted) cliqueAn algorithm which computes a graph vertex clustering.A clustering.Default implementation of the clustering interface.CycleBasisAlgorithm<V,
E> Allows to derive an undirected cycle basis of a given graph.An undirected cycle basis.Default implementation of the undirected cycle basis interface.EdgeScoringAlgorithm<E,D> An interface for all algorithms which assign scores to edges of a graph.Computes an Eulerian cycle of an Eulerian graph.FlowAlgorithm<V,E> Interface for flow algorithmsRepresents a flow.Default implementation ofFlowAlgorithm.Flow
An algorithm solving the Hamiltonian cycle problem.An algorithm improving the result of solving the Hamiltonian cycle problem.Algorithm to compute an Independent Set in a graph.A (weighted) Independent SetDefault implementation of a (weighted) independent setAn algorithm which computes $k$shortest paths between vertices.A link prediction algorithm.Algorithm to compute a lowest common ancestor in a tree, forest or DAG.An algorithm which computes shortest paths from all sources to all targets.Base class for manytomany shortest paths implementations.A set of paths from all sources vertices to all target vertices.MatchingAlgorithm<V,E> Allows to derive a matching of a given graph.A graph matching.A default implementation of the matching interface.A maximal clique enumeration algorithm.Interface for algorithms computing the maximum density subgraphMaximumFlowAlgorithm<V,E> Allows to derive maximumflow from the supplied flow networkA maximum flowDefault implementation of the maximum flowAllows to calculate minimum cost flow on the specified minimum cost flow problem.Represents a minimum cost flow.Default implementation of theMinimumCostFlowAlgorithm.MinimumCostFlow
The algorithm for finding minimum cycle mean in a graph.Given a weighted graph $G(V,E)$ (directed or undirected).An algorithm which computes multiobjective shortest paths between vertices.A set of paths starting from a single source vertex.Algorithm to compute a vertex partitioning of a graph.Default implementation of a vertex partitionAllows to check the planarity of the graph.A combinatorial embedding of the graph.Implementation of thePlanarityTestingAlgorithm.Embedding
.An algorithm which computes shortest paths between vertices.A set of paths starting from a single source vertex.An algorithm which computes a graph spanner of a given graph.A graph spanner.Default implementation of the spanner interface.An algorithm which computes a spanning tree of a given connected graph.A spanning tree.Default implementation of the spanning tree interface.A strong connectivity inspector algorithm.An algorithm which computes a decomposition into disjoint paths for a given tree/forestA path decomposition.Default implementation of the path decomposition interface.An algorithm which computes a graph vertex coloring.A coloring.Default implementation of the coloring interface.Computes a (weighted) vertex cover in an undirected graph.Default implementation of a (weighted) vertex coverAn interface for all algorithms which assign scores to vertices of a graph.