Class ShortestPath<T>

java.lang.Object
com.ibm.wala.analysis.arraybounds.hypergraph.algorithms.ShortestPath<T>
Type Parameters:
T - NodeValueType

public class ShortestPath<T> extends Object
Author:
Stephan Gocht <stephan@gobro.de>
See Also:
  • 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 in HyperNode.getWeight().

      This is using a variation of Bellman-Ford for hyper graphs.

      Parameters:
      comparator - defines order on weights.