![]() | PlanGraphGenerator Class |
Namespace: de.unika.ipd.grGen.lgsp
public static class PlanGraphGenerator
The PlanGraphGenerator type exposes the following members.
Name | Description | |
---|---|---|
![]() ![]() | DumpPlanGraph | |
![]() ![]() | GeneratePlanGraph |
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.
|
![]() ![]() | GenerateStaticPlanGraph |
Generate plan graph for given pattern graph with costs from initial static schedule handed in with graph elements.
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.
|
![]() ![]() | MarkMinimumSpanningArborescence |
Marks the minimum spanning arborescence of a plan graph by setting the IncomingMSAEdge
fields for all nodes
|