Uses of Class
org.jgrapht.alg.cycle.AhujaOrlinSharmaCyclicExchangeLocalAugmentation.PathSetKey

Packages that use AhujaOrlinSharmaCyclicExchangeLocalAugmentation.PathSetKey

Package	Description
org.jgrapht.alg.cycle	Algorithms related to graph cycles.

Uses of AhujaOrlinSharmaCyclicExchangeLocalAugmentation.PathSetKey in org.jgrapht.alg.cycle

Method parameters in org.jgrapht.alg.cycle with type arguments of type AhujaOrlinSharmaCyclicExchangeLocalAugmentation.PathSetKey

Modifier and Type	Method	Description
private boolean	AhujaOrlinSharmaCyclicExchangeLocalAugmentation.checkDominatedPathsOfLengthK(AhujaOrlinSharmaCyclicExchangeLocalAugmentation<V,E>.LabeledPath<V> path, Map<AhujaOrlinSharmaCyclicExchangeLocalAugmentation<V,E>.PathSetKey<V>,AhujaOrlinSharmaCyclicExchangeLocalAugmentation<V,E>.LabeledPath<V>> pathsLengthK)	Checks whether path is dominated by some path in the previously calculated set of paths of length k.
private boolean	AhujaOrlinSharmaCyclicExchangeLocalAugmentation.checkDominatedPathsOfLengthKplus1(AhujaOrlinSharmaCyclicExchangeLocalAugmentation<V,E>.LabeledPath<V> path, Map<AhujaOrlinSharmaCyclicExchangeLocalAugmentation<V,E>.PathSetKey<V>,AhujaOrlinSharmaCyclicExchangeLocalAugmentation<V,E>.LabeledPath<V>> pathsLengthKplus1)	Checks whether path dominates the current minimal cost path with the same head, tail and label set in the set of all paths of length k + 1.
private void	AhujaOrlinSharmaCyclicExchangeLocalAugmentation.updatePathIndex(Map<AhujaOrlinSharmaCyclicExchangeLocalAugmentation<V,E>.PathSetKey<V>,AhujaOrlinSharmaCyclicExchangeLocalAugmentation<V,E>.LabeledPath<V>> paths, AhujaOrlinSharmaCyclicExchangeLocalAugmentation<V,E>.LabeledPath<V> path)	Adds a path and removes the path, which has the same tail, head and label set, to the data structure paths, which contains all paths indexed by their head, tail and label set.