Package de.saar.chorus.domgraph.chart

Provides classes for working with dominance charts.

See:
          Description

Class Summary
Chart A chart for storing intermediate results of the graph-chart solver.
ChartPresenter  
ChartSolver A solver for compact weakly normal dominance graphs.
CompleteSplitSource A split source which computes the complete list of splits for a subgraph.
OneSplitSource A split source which only computes the first split for each subgraph.
SolvedFormIterator An iterator over the different solved forms represented by a Chart.
Split A split in a dominance chart.
SplitSource An abstract superclass for classes that compute splits.
 

Package de.saar.chorus.domgraph.chart Description

Provides classes for working with dominance charts. Dominance charts are underspecified representations that are a bit more explicit (and potentially larger) than dominance graphs, but still exponentially smaller than the set of solved forms itself.

Roughly speaking, this package contains three types of classes:

The lifecycle of a chart is as follows. You can compute it from a compact weakly normal dominance graph by calling a solve method of the class ChartSolver for the graph. You may then apply further operations to the chart, such as redundancy elimination. Finally you can extract the solved forms from a chart by creating a SolvedFormIterator for it.