GrGen.NET v4.4 API: the libGr class library (the type exact interface gets generated)
GeneratePlanGraph Method (graphStatistics, patternGraph, isNegativeOrIndependent, isSubpatternLike, presetsFromIndependentInlining)
Namespacesde.unika.ipd.grGen.lgspLGSPMatcherGeneratorGeneratePlanGraph(LGSPGraphStatistics, PatternGraph, Boolean, Boolean, IDictionary<(Of <<'(PatternElement, SetValueType>)>>))
Generate plan graph for given pattern graph with costs from the analyzed host graph. Plan graph contains nodes representing the pattern elements (nodes and edges) and edges representing the matching operations to get the elements by. Edges in plan graph are given in the nodes by incoming list, as needed for MSA computation.
Declaration Syntax
public PlanGraph GeneratePlanGraph(
	LGSPGraphStatistics graphStatistics,
	PatternGraph patternGraph,
	bool isNegativeOrIndependent,
	bool isSubpatternLike,
	IDictionary<PatternElement, SetValueType> presetsFromIndependentInlining
graphStatistics (LGSPGraphStatistics)
patternGraph (PatternGraph)
isNegativeOrIndependent (Boolean)
isSubpatternLike (Boolean)
presetsFromIndependentInlining (IDictionary<(Of <(<'PatternElement, SetValueType>)>)>)

Assembly: lgspBackend (Module: lgspBackend) Version: (