Class ShortestPath<T>
java.lang.Object
com.ibm.wala.analysis.arraybounds.hypergraph.algorithms.ShortestPath<T>
- Type Parameters:
T
- NodeValueType
- Author:
- Stephan Gocht
<stephan@gobro.de>
- See Also:
-
Method Summary
Modifier and TypeMethodDescriptionstatic <NodeValueType>
voidcompute
(DirectedHyperGraph<NodeValueType> graph, HyperNode<NodeValueType> source, Comparator<Weight> comparator) Computes all shortest paths from source.
-
Method Details
-
compute
public static <NodeValueType> void compute(DirectedHyperGraph<NodeValueType> graph, HyperNode<NodeValueType> source, Comparator<Weight> comparator) Computes all shortest paths from source. The result is stored inHyperNode.getWeight()
.This is using a variation of Bellman-Ford for hyper graphs.
- Parameters:
comparator
- defines order on weights.
-