Package com.ibm.wala.analysis.arraybounds.hypergraph

package com.ibm.wala.analysis.arraybounds.hypergraph

This package contains a generic implementation of directed hypergraphs. The implementation is optimized for shortest path search, with ShortestPath

Related Packages

Package	Description
com.ibm.wala.analysis.arraybounds
com.ibm.wala.analysis.arraybounds.hypergraph.algorithms
com.ibm.wala.analysis.arraybounds.hypergraph.weight

Classes

Class	Description
DirectedHyperEdge<T>	A DirectedHyperEdge is an edge of a DirectedHyperGraph.
DirectedHyperGraph<T>	Implementation of a directed hyper graph.
HyperNode<T>	A HyperNode is a node of a DirectedHyperGraph.
SoftFinalHyperNode<T>