| Interface | Description |
|---|---|
| AStarAdmissibleHeuristic<V> |
Interface for an admissible heuristic used in A* search.
|
| EulerianCycleAlgorithm<V,E> |
Computes an Eulerian cycle of an Eulerian graph.
|
| KShortestPathAlgorithm<V,E> |
An algorithm which computes k-shortest paths between vertices.
|
| MatchingAlgorithm<V,E> |
Allows to derive a matching of
a given graph.
|
| MatchingAlgorithm.Matching<V,E> |
A graph matching.
|
| MaximalCliqueEnumerationAlgorithm<V,E> |
A maximal clique enumeration algorithm.
|
| MaximumFlowAlgorithm<V,E> |
Allows to derive maximum-flow
from the supplied flow network
|
| MaximumFlowAlgorithm.MaximumFlow<E> |
A maximum flow
|
| 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.
|
| ShortestPathAlgorithm<V,E> |
An algorithm which computes shortest paths between vertices.
|
| ShortestPathAlgorithm.SingleSourcePaths<V,E> |
A set of paths starting from a single source vertex.
|
| SpannerAlgorithm<E> |
An algorithm which computes a
graph spanner of a
given graph.
|
| SpannerAlgorithm.Spanner<E> |
A graph spanner.
|
| SpanningTreeAlgorithm<E> |
An algorithm which computes a spanning
tree of a given connected graph.
|
| SpanningTreeAlgorithm.SpanningTree<E> |
A spanning tree.
|
| StrongConnectivityAlgorithm<V,E> |
A strong connectivity inspector algorithm.
|
| TSPAlgorithm<V,E> |
An algorithm solving the
Travelling salesman
problem (TSP).
|
| VertexColoringAlgorithm<V> |
An algorithm which computes a graph vertex coloring.
|
| VertexColoringAlgorithm.Coloring<V> |
A coloring.
|
| VertexScoringAlgorithm<V,D> |
An interface for all algorithms which assign scores to vertices of a graph.
|
| Class | Description |
|---|---|
| MatchingAlgorithm.MatchingImpl<V,E> |
A default implementation of the matching interface.
|
| MaximumFlowAlgorithm.MaximumFlowImpl<E> |
Default implementation of the maximum flow
|
| MinimumVertexCoverAlgorithm.VertexCoverImpl<V> |
Default implementation of a vertex cover
|
| SpannerAlgorithm.SpannerImpl<E> |
Default implementation of the spanner interface.
|
| SpanningTreeAlgorithm.SpanningTreeImpl<E> |
Default implementation of the spanning tree interface.
|
| VertexColoringAlgorithm.ColoringImpl<V> |
Default implementation of the coloring interface.
|
Copyright © 2017. All rights reserved.