Interface  Description 

AStarAdmissibleHeuristic<V> 
Interface for an admissible heuristic used in A* search.

MatchingAlgorithm<V,E> 
Allows to derive matching from
given graph

MaximumFlowAlgorithm<V,E> 
Allows to derive maximumflow
from the supplied flow network

MaximumFlowAlgorithm.MaximumFlow<E> 
A maximum flow

MinimumSpanningTree<V,E> 
Allows to derive minimum spanning
tree from given undirected connected graph.

MinimumSTCutAlgorithm<V,E> 
Given a weighted graph G(V,E) (directed or undirected).

MinimumVertexCoverAlgorithm<V,E> 
Computes a vertex cover in an undirected graph.

MinimumVertexCoverAlgorithm.VertexCover<V> 
A vertex cover

MinimumWeightedVertexCoverAlgorithm<V,E> 
Computes a weighted vertex cover in an undirected graph.

StrongConnectivityAlgorithm<V,E> 
An interface to the StrongConnectivityInspector algorithm classes.

WeightedMatchingAlgorithm<V,E> 
Allows to derive weighted matching from general graph

Class  Description 

MaximumFlowAlgorithm.MaximumFlowImpl<E> 
Default implementation of the maximum flow

MinimumVertexCoverAlgorithm.VertexCoverImpl<V> 
Default implementation of a vertex cover

Copyright © 2016. All rights reserved.