public IntervalAnalyzer(ISingleEntrySubGraph graph, Dictionary <ILogicalConstruct, HashSet <ILogicalConstruct> > removedEdges)
{
base();
this.availableNodes = graph.get_Children();
this.entryPoint = graph.get_Entry() as ILogicalConstruct;
this.headers = new Queue <ILogicalConstruct>();
this.intervals = new List <IntervalConstruct>();
this.nodeToInterval = new Dictionary <ISingleEntrySubGraph, IntervalConstruct>();
this.removedEdges = removedEdges;
return;
}
public static DFSTree BuildTree(ISingleEntrySubGraph theGraph)
{
return(DFSTBuilder.BuildTree(theGraph, theGraph.get_Entry()));
}
