Package org.jgrapht.alg.interfaces

Interface Summary

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 maximum-flow from the supplied flow network
MaximumFlowAlgorithm.MaximumFlow<V,E>
MinimumSpanningTree<V,E>	Allows to derive minimum spanning tree from given undirected connected graph.
StrongConnectivityAlgorithm<V,E>	An interface to the StrongConnectivityInspector algorithm classes.
WeightedMatchingAlgorithm<V,E>	Allows to derive weighted matching from general graph

Class Summary

Class	Description
MaximumFlowAlgorithm.MaximumFlowImpl<V,E>