ReachabilityGraph (SystemDS 2.2.1 API)

public class ReachabilityGraph
extends Object

Nested Classes
Modifier and Type	Class and Description
`static class`	`ReachabilityGraph.SubProblem`

Constructors
Constructor and Description
`ReachabilityGraph(PlanPartition part, CPlanMemoTable memo)`

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`org.apache.sysds.hops.codegen.opt.ReachabilityGraph.CutSet`	`getCutSet(boolean[] plan)`
`long`	`getNumSkipPlans(boolean[] plan)`
`InterestingPoint[]`	`getSortedSearchSpace()`
`ReachabilityGraph.SubProblem[]`	`getSubproblems(boolean[] plan)`
`boolean`	`isCutSet(boolean[] plan)`
`boolean`	`isCutSet(org.apache.sysds.hops.codegen.opt.ReachabilityGraph.CutSet cs, boolean[] plan)`
`String`	`toString()`

Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait

public ReachabilityGraph(PlanPartition part,
                         CPlanMemoTable memo)

public InterestingPoint[] getSortedSearchSpace()

public boolean isCutSet(boolean[] plan)

public boolean isCutSet(org.apache.sysds.hops.codegen.opt.ReachabilityGraph.CutSet cs,
                        boolean[] plan)

public org.apache.sysds.hops.codegen.opt.ReachabilityGraph.CutSet getCutSet(boolean[] plan)

public long getNumSkipPlans(boolean[] plan)

public ReachabilityGraph.SubProblem[] getSubproblems(boolean[] plan)

Class ReachabilityGraph