com.ibm.wala.analysis.arraybounds.hypergraph

Class DirectedHyperGraph<T>

java.lang.Object

com.ibm.wala.analysis.arraybounds.hypergraph.DirectedHyperGraph<T>

Direct Known Subclasses:

ArrayBoundsGraph

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

Implementation of a directed hyper graph. In a hyper graph an edge can have more than one head and more than one tail.

Constructor Summary

Constructors

Constructor and Description
DirectedHyperGraph()

Method Summary

Modifier and Type	Method and Description
java.util.Set<DirectedHyperEdge<T>>	getEdges()
java.util.Map<T,HyperNode<T>>	getNodes()
void	reset() Resets the weight of all nodes.
java.lang.String	toString()
void	updateNodeEdges() The outdEdges of a node may not have been set on construction.

Methods inherited from class java.lang.Object

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

Constructor Detail

DirectedHyperGraph

public DirectedHyperGraph()

Method Detail

getEdges

public java.util.Set<DirectedHyperEdge<T>> getEdges()

getNodes

public java.util.Map<T,HyperNode<T>> getNodes()

reset

public void reset()

Resets the weight of all nodes.

toString

public java.lang.String toString()

Overrides:

toString in class java.lang.Object

updateNodeEdges

public void updateNodeEdges()

The outdEdges of a node may not have been set on construction. Use this method to set them based on the edges of this HyperGraph.