| Package | Description |
|---|---|
| org.jgrapht.alg |
Algorithms provided with JGraphT.
|
| org.jgrapht.alg.flow | |
| org.jgrapht.alg.interfaces |
| Class and Description |
|---|
| AStarAdmissibleHeuristic
Interface for an admissible heuristic used in A* search.
|
| MatchingAlgorithm
Allows to derive matching from
given graph
|
| MaximumFlowAlgorithm
Allows to derive maximum-flow
from the supplied flow
network
|
| MaximumFlowAlgorithm.MaximumFlow |
| MinimumSpanningTree
Allows to derive
minimum spanning tree from given undirected connected graph.
|
| StrongConnectivityAlgorithm
An interface to the StrongConnectivityInspector algorithm classes.
|
| WeightedMatchingAlgorithm
Allows to derive weighted matching from general graph
|
| Class and Description |
|---|
| MaximumFlowAlgorithm
Allows to derive maximum-flow
from the supplied flow
network
|
| MaximumFlowAlgorithm.MaximumFlow |
| Class and Description |
|---|
| MatchingAlgorithm
Allows to derive matching from
given graph
|
| MaximumFlowAlgorithm.MaximumFlow |
Copyright © 2016. All rights reserved.