Package 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 Object

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

Author:

Stephan Gocht <stephan@gobro.de>

Constructor Summary

Constructors

Constructor	Description
DirectedHyperGraph()

Method Summary

Modifier and Type	Method	Description
Set<DirectedHyperEdge<T>>	getEdges()
Map<T,HyperNode<T>>	getNodes()
void	reset()	Resets the weight of all nodes.
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 Details

DirectedHyperGraph

public DirectedHyperGraph()

Method Details

getEdges

public Set<DirectedHyperEdge<T>> getEdges()

getNodes

public Map<T,HyperNode<T>> getNodes()

reset

public void reset()

Resets the weight of all nodes.

toString

public String toString()

Overrides:

toString in class 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.