Click or drag to resize

PlanSuperNode Class

Element of the plan graph representing a strongly connected component within the pattern graph. Hierachically nested.
Inheritance Hierarchy
SystemObject
  de.unika.ipd.grGen.lgspPlanPseudoNode
    de.unika.ipd.grGen.lgspPlanSuperNode

Namespace: de.unika.ipd.grGen.lgsp
Assembly: lgspBackend (in lgspBackend.dll) Version: GrGen.NET 7.1
Syntax
C#
public class PlanSuperNode : PlanPseudoNode

The PlanSuperNode type exposes the following members.

Constructors
 NameDescription
Public methodPlanSuperNodeInitializes a new instance of the PlanSuperNode class
Top
Properties
 NameDescription
Public propertyIncoming Returns all incoming plan edges.
(Overrides PlanPseudoNodeIncoming)
Public propertyTopNode outermost enclosing supernode, the node itself if not contained within a supernode
(Inherited from PlanPseudoNode)
Public propertyTopSuperNode outermost enclosing supernode, null if not contained within a supernode
(Inherited from PlanPseudoNode)
Top
Methods
 NameDescription
Public methodGetCheapestIncoming Returns the cheapest incoming plan edge and its cost, excluding nodes contained within the given top super node (if given)
(Overrides PlanPseudoNodeGetCheapestIncoming(PlanPseudoNode, Single))
Public methodPreferNewEdge Decides whether a new edge is better than a known best edge up to now.
(Inherited from PlanPseudoNode)
Top
Fields
 NameDescription
Public fieldChild Representative element of the cycle as entry point. Target of cheapest incoming edge.
Public fieldIncomingMSAEdge
(Inherited from PlanPseudoNode)
Public fieldminCycleEdgeCost 
Public fieldSuperNode
(Inherited from PlanPseudoNode)
Top
See Also