GrGen.NET v4.4 API: the libGr class library (the type exact interface gets generated)
LGSPNamedGraph Class
Namespacesde.unika.ipd.grGen.lgspLGSPNamedGraph
An implementation of the INamedGraph interface.
Declaration Syntax
C#
public class LGSPNamedGraph : LGSPGraph, 
	INamedGraph, IGraph
Members
All MembersConstructorsMethodsPropertiesFieldsEvents



IconMemberDescription
LGSPNamedGraph(IGraphModel, Int32)
Constructs an LGSPNamedGraph object with the given model and capacity, and an automatically generated name.

LGSPNamedGraph(IGraphModel, LGSPBackend, Int32)
Constructs an LGSPNamedGraph object with the given model, backend, and capacity, and an automatically generated name.

LGSPNamedGraph(IGraphModel, String, Int32)
Constructs an LGSPNamedGraph object with the given model, name, and capacity.

LGSPNamedGraph(IGraphModel, LGSPBackend, String, Int32)
Constructs an LGSPNamedGraph object with the given model, backend, name, and capacity.

LGSPNamedGraph(LGSPBackend, IGraphModel, String, String, Int32)
Constructs an LGSPNamedGraph object. Deprecated.

LGSPNamedGraph(String)
Constructs an LGSPNameGraph object without initializing it.

LGSPNamedGraph(LGSPNamedGraph, String, IDictionary<(Of <<'(IGraphElement, IGraphElement>)>>)%)
Copy constructor.

LGSPNamedGraph(LGSPNamedGraph, String)
Copy constructor.

LGSPNamedGraph(LGSPGraph, IDictionary<(Of <<'(IGraphElement, IGraphElement>)>>)%)
Copy and extend constructor, creates a named graph from a normal graph. Initializes the name maps with anonymous names in the form "$" + GetNextName()

LGSPNamedGraph(LGSPGraph)
Copy and extend constructor, creates a named graph from a normal graph. Initializes the name maps with anonymous names in the form "$" + GetNextName()

LGSPNamedGraph(LGSPGraph, String, IDictionary<(Of <<'(IGraphElement, IGraphElement>)>>)%)
Copy and extend constructor, creates a named graph from a normal graph. Initializes the name maps with the names provided in a given attribute each graph element must have

LGSPNamedGraph(LGSPGraph, String)
Copy and extend constructor, creates a named graph from a normal graph. Initializes the name maps with the names provided in a given attribute each graph element must have

AddEdge(IEdge, String)
AddEdge(LGSPEdge, String)
AddEdge(EdgeType, INode, INode, String)
AddEdge(EdgeType, LGSPNode, LGSPNode, String)
AddEdge(IEdge) (Overrides LGSPGraph.AddEdge(IEdge).)
AddEdge(LGSPEdge) (Overrides LGSPGraph.AddEdge(LGSPEdge).)
AddEdge(EdgeType, INode, INode) (Overrides LGSPGraph.AddEdge(EdgeType, INode, INode).)
AddEdge(EdgeType, LGSPNode, LGSPNode) (Overrides LGSPGraph.AddEdge(EdgeType, LGSPNode, LGSPNode).)
AddEdgeWithoutEvents(LGSPEdge, Int32)
Adds an existing edge to this graph. The graph may not already contain the edge! The edge may not be connected to any other elements! Intended only for undo, clone, retyping and internal use!
(Inherited from LGSPGraph.)
AddLGSPNode(NodeType, String)
AddLGSPNode(NodeType) (Overrides LGSPGraph.AddLGSPNode(NodeType).)
AddNode(INode, String)
AddNode(LGSPNode, String)
AddNode(NodeType, String)
AddNode(INode) (Overrides LGSPGraph.AddNode(INode).)
AddNode(LGSPNode) (Overrides LGSPGraph.AddNode(LGSPNode).)
AddNode(NodeType) (Overrides LGSPGraph.AddNode(NodeType).)
AddNodeWithoutEvents(LGSPNode, Int32)
Adds an existing node to this graph. The graph may not already contain the node! The edge may not be connected to any other elements! Intended only for undo, clone, retyping and internal use!
(Inherited from LGSPGraph.)
AllocateFurtherIsomorphySpaceNestingLevelForParallelizedMatching(Int32) (Inherited from LGSPGraph.)
AllocateVisitedFlag()()()()
Allocates a visited flag on the graph elements.
(Inherited from LGSPGraph.)
AnalyzeGraph()()()()
Analyzes the graph. The calculated data is used to generate good searchplans for the current graph.
(Inherited from LGSPGraph.)
Backend
The backend that created the graph
(Inherited from LGSPGraph.)
Canonize()()()()
Returns a canonical representation of the graph as a string
(Inherited from LGSPGraph.)
ChangedEdgeAttribute(IEdge, AttributeType) (Inherited from BaseGraph.)
ChangedNodeAttribute(INode, AttributeType) (Inherited from BaseGraph.)
ChangesCounter
Returns a counter of the number of changes that occured since the graph was created. If it's different since last time you visited, the graph has changed (but it may be back again in the original state). Only graph structure changes are counted, attribute changes are not included.
(Inherited from LGSPGraph.)
changesCounterAtLastAnalyze (Inherited from LGSPGraph.)
changesCounterAtLastCanonize (Inherited from LGSPGraph.)
ChangingEdgeAttribute(IEdge, AttributeType, AttributeChangeType, Object, Object) (Inherited from BaseGraph.)
ChangingNodeAttribute(INode, AttributeType, AttributeChangeType, Object, Object) (Inherited from BaseGraph.)
Check()()()() (Inherited from LGSPGraph.)
CheckEdgeAlreadyInTypeRinglist(LGSPEdge)
Checks if the given edge is already available in its type ringlist
(Inherited from LGSPGraph.)
CheckEmptyFlags()()()()
Checks if the matching state flags in the graph are not set, as they should be in case no matching is undereway
(Inherited from LGSPGraph.)
CheckInOutRinglistsBroken(LGSPNode)
Checks whether the incoming or outgoing ringlists of the given node are broken. Use for debugging purposes.
(Inherited from LGSPGraph.)
CheckNodeAlreadyInTypeRinglist(LGSPNode)
Checks if the given node is already available in its type ringlist
(Inherited from LGSPGraph.)
CheckTypeRinglistBroken(LGSPNode)
Checks whether the type ringlist starting at the given head node is broken. Use for debugging purposes.
(Inherited from LGSPGraph.)
CheckTypeRinglistBroken(LGSPEdge)
Checks whether the type ringlist starting at the given head edge is broken. Use for debugging purposes.
(Inherited from LGSPGraph.)
CheckTypeRinglistsBroken()()()()
Checks whether the type ringlists are broken. Use for debugging purposes.
(Inherited from LGSPGraph.)
Clear()()()() (Overrides LGSPGraph.Clear()()()().)
ClearingGraph()()()()
Fires an OnClearingGraph event.
(Inherited from BaseGraph.)
Clone(String) (Overrides LGSPGraph.Clone(String).)
CloneAndAssignNames()()()()
Duplicates a graph, assigning names. The new graph will use the same model and backend as the other Open transaction data will not be cloned.
(Inherited from LGSPGraph.)
CloneNamed(String)
CreateEmptyEquivalent(String) (Overrides LGSPGraph.CreateEmptyEquivalent(String).)
Custom(array<Object>[]()[][])
Does graph-backend dependent stuff.
(Inherited from LGSPGraph.)
DifferentElementWithName(IGraphElement, String)
returns whether another element than the one given already bears the name

DoName()()()()
Initializes the name maps with anonymous names in the form "$" + GetNextName()

DoName(String)

EdgeAdded(IEdge)
Fires an OnEdgeAdded event.
(Inherited from BaseGraph.)
Edges (Inherited from BaseGraph.)
edgesByTypeCounts
The number of edges for each edge type indexed by the type ID.
(Inherited from LGSPGraph.)
edgesByTypeHeads
An array containing one head of a doubly-linked ring-list for each edge type indexed by the type ID.
(Inherited from LGSPGraph.)
EnsureSufficientIsomorphySpacesForParallelizedMatchingAreAvailable(Int32) (Inherited from LGSPGraph.)
flagsPerThreadPerElement
a list which stores for each parallel matcher thread, per graph element the flags with the matching state each flag encodes a bounded amount of the is-matched-bits for the lowest isomorphy spaces, the flag is a reduced version of the flags bitvector available in each graph element in case of single threaded matching (the unique id of the graph elements is used as index into the flags array)
(Inherited from LGSPGraph.)
FreeVisitedFlag(Int32)
Frees a visited flag. This is a safe but O(n) operation, as it resets the visited flag in the graph.
(Inherited from LGSPGraph.)
FreeVisitedFlagNonReset(Int32)
Frees a clean visited flag. This is an O(1) but potentially unsafe operation. Attention! A marked element stays marked, so a later allocation hands out a dirty visited flag! Use only if you can ensure that all elements of that flag are unmarked before calling.
(Inherited from LGSPGraph.)
GetAllocatedVisitedFlags()()()()
Returns the ids of the allocated visited flags.
(Inherited from LGSPGraph.)
GetCompatibleEdges(EdgeType)
Enumerates all edges compatible to the given edge type.
(Inherited from LGSPGraph.)
GetCompatibleNodes(NodeType)
Enumerates all nodes compatible to the given node type.
(Inherited from LGSPGraph.)
GetEdge(String)
GetEdge(Int32)
Gets the edge for the given id. Only available if the unique index was declared in the model.
(Inherited from LGSPGraph.)
GetEdgeType(String)
Returns the edge type with the given name.
(Inherited from BaseGraph.)
GetElementName(IGraphElement)
GetExactEdges(EdgeType)
Enumerates all edges with the exact given edge type.
(Inherited from LGSPGraph.)
GetExactNodes(NodeType)
Enumerates all nodes with the exact given node type.
(Inherited from LGSPGraph.)
GetGraphElement(String)
GetGraphElement(Int32)
Gets the graph element for the given unique id. Only available if the unique index was declared in the model.
(Inherited from LGSPGraph.)
GetNode(String)
GetNode(Int32)
Gets the node for the given unique id. Only available if the unique index was declared in the model.
(Inherited from LGSPGraph.)
GetNodeType(String)
Returns the node type with the given name.
(Inherited from BaseGraph.)
GetNumCompatibleEdges(EdgeType)
Returns the number of edges compatible to the given edge type.
(Inherited from LGSPGraph.)
GetNumCompatibleNodes(NodeType)
Returns the number of nodes compatible to the given node type.
(Inherited from LGSPGraph.)
GetNumExactEdges(EdgeType)
Returns the number of edges with the exact given edge type.
(Inherited from LGSPGraph.)
GetNumExactNodes(NodeType)
Returns the number of nodes with the exact given node type.
(Inherited from LGSPGraph.)
graphID (Inherited from LGSPGraph.)
GraphId (Inherited from LGSPGraph.)
HasSameStructure(IGraph) (Inherited from LGSPGraph.)
HasSameStructure(IDictionary<(Of <<'(IGraph, SetValueType>)>>))
Returns whether this graph is isomorph to any of the set of graphs given, neglecting the attribute values, only structurally Don't call from a parallelized matcher!
(Inherited from LGSPGraph.)
indices (Inherited from LGSPGraph.)
Indices
The indices associated with the graph.
(Inherited from LGSPGraph.)
inIsoSpaceMatchedElements
a list with the isomorphy spaces, each contains in a dictionary the elements matched locally used in case the is-matched-bits in the graph elements are not sufficient (during non-parallel matching)
(Inherited from LGSPGraph.)
inIsoSpaceMatchedElementsGlobal
a list with the isomorphy spaces, each contains in a dictionary the elements matched globally used in case the is-matched-bits in the graph elements are not sufficient (during non-parallel matching)
(Inherited from LGSPGraph.)
InitializeGraph(IGraphModel)
Initializes the graph with the given model.
(Inherited from LGSPGraph.)
InitializeVariables()()()()
IsInternallyVisited(IGraphElement)
Returns whether the given graph element has been internally visited. (Used for computing reachability.)
(Inherited from LGSPGraph.)
IsInternallyVisited(IGraphElement, Int32)
Returns whether the given graph element has been internally visited. (Used for computing reachability when employed from a parallelized matcher executed by the thread pool.)
(Inherited from LGSPGraph.)
IsIsomorph(IGraph)
Returns whether this graph is isomorph to that graph (including the attribute values) If a graph changed only in attribute values since the last comparison, results will be wrong! (Do a fake node insert and removal to ensure the graph is recognized as having changed.)
(Inherited from LGSPGraph.)
IsIsomorph(IDictionary<(Of <<'(IGraph, SetValueType>)>>))
Returns whether this graph is isomorph to any of the set of graphs given (including the attribute values) If a graph changed only in attribute values since the last comparison, results will be wrong! (Do a fake node insert and removal to ensure the graph is recognized as having changed.) Don't call from a parallelized matcher!
(Inherited from LGSPGraph.)
IsVisited(IGraphElement, Int32)
Returns whether the given graph element has been visited.
(Inherited from LGSPGraph.)
matchingState
Normally null, contains some data which allows for efficient graph comparison, in case this is a constant graph which was used for isomorphy checking
(Inherited from LGSPGraph.)
Merge(INode, INode)
Merge(LGSPNode, LGSPNode, String)
Merges the source node into the target node, i.e. all edges incident to the source node are redirected to the target node, then the source node is deleted.
(Inherited from LGSPGraph.)
Merge(INode, INode, String)
Merges the source node into the target node, i.e. all edges incident to the source node are redirected to the target node, then the source node is deleted.
(Inherited from LGSPGraph.)
model (Inherited from LGSPGraph.)
Model
The model associated with the graph.
(Inherited from LGSPGraph.)
MoveHeadAfter(LGSPNode)
Moves the type list head of the given node after the given node. Part of the "list trick".
(Inherited from LGSPGraph.)
MoveHeadAfter(LGSPEdge)
Moves the type list head of the given edge after the given edge. Part of the "list trick".
(Inherited from LGSPGraph.)
Name
A name associated with the graph.
(Inherited from LGSPGraph.)
nameOfSingleElementAdded (Inherited from LGSPGraph.)
NodeAdded(INode)
Fires an OnNodeAdded event.
(Inherited from BaseGraph.)
Nodes (Inherited from BaseGraph.)
nodesByTypeCounts
The number of nodes for each node type indexed by the type ID.
(Inherited from LGSPGraph.)
nodesByTypeHeads
An array containing one head of a doubly-linked ring-list for each node type indexed by the type ID.
(Inherited from LGSPGraph.)
NumEdges (Inherited from BaseGraph.)
NumNodes (Inherited from BaseGraph.)
OnChangedEdgeAttribute (Inherited from BaseGraph.)
OnChangedNodeAttribute (Inherited from BaseGraph.)
OnChangingEdgeAttribute (Inherited from BaseGraph.)
OnChangingNodeAttribute (Inherited from BaseGraph.)
OnClearingGraph (Inherited from BaseGraph.)
OnEdgeAdded (Inherited from BaseGraph.)
OnNodeAdded (Inherited from BaseGraph.)
OnRedirectingEdge (Inherited from BaseGraph.)
OnRemovingEdge (Inherited from BaseGraph.)
OnRemovingEdges (Inherited from BaseGraph.)
OnRemovingNode (Inherited from BaseGraph.)
OnRetypingEdge (Inherited from BaseGraph.)
OnRetypingNode (Inherited from BaseGraph.)
OnSettingAddedEdgeNames (Inherited from BaseGraph.)
OnSettingAddedNodeNames (Inherited from BaseGraph.)
OnSettingVisited (Inherited from BaseGraph.)
OnVisitedAlloc (Inherited from BaseGraph.)
OnVisitedFree (Inherited from BaseGraph.)
perThreadInIsoSpaceMatchedElements
a list which stores for each matcher thread the isomorphy spaces, each contains in a dictionary the elements matched locally used in case the is-matched-bits in the per-thread flags array are not sufficient, employed during parallelized matching the outermost list is read concurrently, so its dimension/content must be fixed before matching begins
(Inherited from LGSPGraph.)
perThreadInIsoSpaceMatchedElementsGlobal
a list which stores for each matcher thread the isomorphy spaces, each contains in a dictionary the elements matched globally used in case the is-matched-bits in the per-thread flags array are not sufficient, employed during parallelized matching the outermost list is read concurrently, so its dimension/content must be fixed before matching begins
(Inherited from LGSPGraph.)
ReallocateVisitedFlag(Int32)
Called by the transaction manager on flags it reserved from getting handed out again during valloc, when the transaction is rolled back, and the vfree is undone by a realloc.
(Inherited from LGSPGraph.)
RedirectingEdge(IEdge)
Fires an OnRedirectingEdge event.
(Inherited from BaseGraph.)
RedirectSource(IEdge, INode)
RedirectSource(LGSPEdge, LGSPNode, String)
Changes the source node of the edge from the old source to the given new source.
(Inherited from LGSPGraph.)
RedirectSource(IEdge, INode, String)
Changes the source node of the edge from the old source to the given new source.
(Inherited from LGSPGraph.)
RedirectSourceAndTarget(IEdge, INode, INode)
RedirectSourceAndTarget(LGSPEdge, LGSPNode, LGSPNode, String, String)
Changes the source of the edge from the old source to the given new source, and changes the target node of the edge from the old target to the given new target.
(Inherited from LGSPGraph.)
RedirectSourceAndTarget(IEdge, INode, INode, String, String)
Changes the source of the edge from the old source to the given new source, and changes the target node of the edge from the old target to the given new target.
(Inherited from LGSPGraph.)
RedirectTarget(IEdge, INode)
RedirectTarget(LGSPEdge, LGSPNode, String)
Changes the target node of the edge from the old target to the given new target.
(Inherited from LGSPGraph.)
RedirectTarget(IEdge, INode, String)
Changes the target node of the edge from the old target to the given new target.
(Inherited from LGSPGraph.)
Remove(INode) (Overrides LGSPGraph.Remove(INode).)
Remove(IEdge) (Overrides LGSPGraph.Remove(IEdge).)
RemoveEdges(INode)
Removes all edges from the given node.
(Inherited from LGSPGraph.)
RemovingEdge(IEdge)
Fires an OnRemovingEdge event.
(Inherited from BaseGraph.)
RemovingEdges(INode)
Fires an OnRemovingEdges event.
(Inherited from BaseGraph.)
RemovingNode(INode)
Fires an OnRemovingNode event.
(Inherited from BaseGraph.)
ReplaceEdge(LGSPEdge, LGSPEdge)
Replaces a given edge by another one. Source and target node are transferred to the new edge, but the new edge must already have source and target set to these nodes. The new edge is added to the graph, the old edge is removed. A SettingEdgeType event is generated before. The attributes are not touched. This function is used for retyping.
(Inherited from LGSPGraph.)
ReplaceNode(LGSPNode, LGSPNode)
Replaces a given node by another one. All incident edges and variables are transferred to the new node. The attributes are not touched. This function is used for retyping.
(Inherited from LGSPGraph.)
ReserveVisitedFlag(Int32)
Called by the transaction manager just when it gets notified about a vfree. The visited flag freed must be reserved until the transaction finished, cause otherwise it might be impossible for the transaction manager to roll the vfree back with a valloc; that may happen if the flag is handed out again in a succeeding valloc, during a transaction pause.
(Inherited from LGSPGraph.)
ResetVisitedFlag(Int32)
Resets the visited flag with the given ID on all graph elements, if necessary.
(Inherited from LGSPGraph.)
Retype(LGSPNode, NodeType) (Overrides LGSPGraph.Retype(LGSPNode, NodeType).)
Retype(LGSPEdge, EdgeType) (Overrides LGSPGraph.Retype(LGSPEdge, EdgeType).)
Retype(INode, NodeType) (Inherited from LGSPGraph.)
Retype(IEdge, EdgeType) (Inherited from LGSPGraph.)
RetypingEdge(IEdge, IEdge)
Fires an OnRetypingEdge event.
(Inherited from BaseGraph.)
RetypingNode(INode, INode)
Fires an OnRetypingNode event.
(Inherited from BaseGraph.)
ReuseOptimization
If true (the default case), elements deleted during a rewrite may be reused in the same rewrite. As a result new elements may not be discriminable anymore from already deleted elements using object equality, hash maps, etc. In cases where this is needed this optimization should be disabled.
(Inherited from LGSPGraph.)
SetElementName(IGraphElement, String)
SetElementPrefixName(IGraphElement, String)
SetInternallyVisited(IGraphElement, Boolean)
Sets the internal-use visited flag of the given graph element. (Used for computing reachability.)
(Inherited from LGSPGraph.)
SetInternallyVisited(IGraphElement, Boolean, Int32)
Sets the internal-use visited flag of the given graph element. (Used for computing reachability when employed from a parallelized matcher executed by the thread pool.)
(Inherited from LGSPGraph.)
SettingAddedEdgeNames(array<String>[]()[][]) (Inherited from BaseGraph.)
SettingAddedNodeNames(array<String>[]()[][]) (Inherited from BaseGraph.)
SettingVisited(IGraphElement, Int32, Boolean)
Fires an OnSettingVisited event.
(Inherited from BaseGraph.)
SetVisited(IGraphElement, Int32, Boolean)
Sets the visited flag of the given graph element.
(Inherited from LGSPGraph.)
statistics
Stores the statistics about the last analyze pass of the graph
(Inherited from LGSPGraph.)
ToString()()()() (Overrides LGSPGraph.ToString()()()().)
uniquenessEnsurer (Inherited from LGSPGraph.)
UnreserveVisitedFlag(Int32)
Called by the transaction manager on flags it reserved from getting handed out again during valloc, when the transaction finished and it is safe to return those flags again on valloc.
(Inherited from LGSPGraph.)
Validate(ValidationMode, List<(Of <<'(ConnectionAssertionError>)>>)%) (Inherited from BaseGraph.)
VisitedAlloc(Int32)
Fires an OnVisitedAlloc event.
(Inherited from BaseGraph.)
VisitedFree(Int32)
Fires an OnVisitedFree event.
(Inherited from BaseGraph.)
Inheritance Hierarchy
Object
BaseGraph
 LGSPGraph
  LGSPNamedGraph

Assembly: lgspBackend (Module: lgspBackend) Version: 4.4.0.0 (4.4.0.0)