public class ReachabilityGraph extends Object
| Modifier and Type | Class and Description | 
|---|---|
| static class  | ReachabilityGraph.SubProblem | 
| Constructor and Description | 
|---|
| ReachabilityGraph(PlanPartition part,
                 CPlanMemoTable memo) | 
| 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() | 
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)
Copyright © 2021 The Apache Software Foundation. All rights reserved.