Interface for an admissible heuristic used in A* search.
Allows to derive matching from given graph
A maximum flow
Allows to derive minimum spanning tree from given undirected connected graph.
Given a weighted graph G(V,E) (directed or undirected).
Computes a vertex cover in an undirected graph.
A vertex cover
Computes a weighted vertex cover in an undirected graph.
An interface to the StrongConnectivityInspector algorithm classes.
Allows to derive weighted matching from general graph
Default implementation of the maximum flow
Default implementation of a vertex cover
Copyright © 2016. All rights reserved.