com.ibm.wala.analysis.arraybounds.hypergraph.algorithms

Class ShortestPath<T>

java.lang.Object

com.ibm.wala.analysis.arraybounds.hypergraph.algorithms.ShortestPath<T>

Type Parameters:

T - NodeValueType

public class ShortestPath<T>
extends java.lang.Object

See Also:

compute(DirectedHyperGraph, HyperNode, Comparator)

Method Summary

Modifier and Type	Method and Description
static <NodeValueType> void	compute(DirectedHyperGraph<NodeValueType> graph, HyperNode<NodeValueType> source, java.util.Comparator<Weight> comparator) Computes all shortest paths from source.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Detail

compute

public static <NodeValueType> void compute(DirectedHyperGraph<NodeValueType> graph,
                                           HyperNode<NodeValueType> source,
                                           java.util.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.