GrGen.NET v4.4 API: the libGr class library (the type exact interface gets generated)
LGSPGraph Class
An implementation of the IGraph interface.
Declaration Syntax
C#
public class LGSPGraph : BaseGraph
Members
All MembersConstructorsMethodsPropertiesFieldsEvents



IconMemberDescription
LGSPGraph(IGraphModel)
Constructs an LGSPGraph object with the given model and an automatically generated name.

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

LGSPGraph(IGraphModel, String)
Constructs an LGSPGraph object with the given model and name.

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

LGSPGraph(LGSPBackend, IGraphModel, String, String)
Constructs an LGSPGraph object. Deprecated.

LGSPGraph(String)
Constructs an LGSPGraph object without initializing it.

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

LGSPGraph(LGSPGraph, String)
Copy constructor.

AddEdge(IEdge) (Overrides BaseGraph.AddEdge(IEdge).)
AddEdge(LGSPEdge)
Adds an existing LGSPEdge object to the graph. The edge must not be part of any graph, yet! Source and target of the edge must already be part of the graph.

AddEdge(EdgeType, INode, INode) (Overrides BaseGraph.AddEdge(EdgeType, INode, INode).)
AddEdge(EdgeType, LGSPNode, LGSPNode)
Adds a new edge to the graph.

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!

AddLGSPNode(NodeType)
Creates a new LGSPNode according to the given type and adds it to the graph.

AddNode(INode) (Overrides BaseGraph.AddNode(INode).)
AddNode(LGSPNode)
Adds an existing LGSPNode object to the graph. The node must not be part of any graph, yet! The node may not be connected to any other elements!

AddNode(NodeType) (Overrides BaseGraph.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!

AllocateFurtherIsomorphySpaceNestingLevelForParallelizedMatching(Int32)
AllocateVisitedFlag()()()()
Allocates a visited flag on the graph elements.
(Overrides BaseGraph.AllocateVisitedFlag()()()().)
AnalyzeGraph()()()()
Analyzes the graph. The calculated data is used to generate good searchplans for the current graph.

Backend
The backend that created the graph
(Overrides BaseGraph.Backend.)
Canonize()()()()
Returns a canonical representation of the graph as a string
(Overrides BaseGraph.Canonize()()()().)
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.
(Overrides BaseGraph.ChangesCounter.)
changesCounterAtLastAnalyze
changesCounterAtLastCanonize
ChangingEdgeAttribute(IEdge, AttributeType, AttributeChangeType, Object, Object) (Inherited from BaseGraph.)
ChangingNodeAttribute(INode, AttributeType, AttributeChangeType, Object, Object) (Inherited from BaseGraph.)
Check()()()() (Overrides BaseGraph.Check()()()().)
CheckEdgeAlreadyInTypeRinglist(LGSPEdge)
Checks if the given edge is already available in its type ringlist

CheckEmptyFlags()()()()
Checks if the matching state flags in the graph are not set, as they should be in case no matching is undereway

CheckInOutRinglistsBroken(LGSPNode)
Checks whether the incoming or outgoing ringlists of the given node are broken. Use for debugging purposes.

CheckNodeAlreadyInTypeRinglist(LGSPNode)
Checks if the given node is already available in its type ringlist

CheckTypeRinglistBroken(LGSPNode)
Checks whether the type ringlist starting at the given head node is broken. Use for debugging purposes.

CheckTypeRinglistBroken(LGSPEdge)
Checks whether the type ringlist starting at the given head edge is broken. Use for debugging purposes.

CheckTypeRinglistsBroken()()()()
Checks whether the type ringlists are broken. Use for debugging purposes.

Clear()()()()
Removes all nodes and edges (including any variables pointing to them) from the graph.
(Overrides BaseGraph.Clear()()()().)
ClearingGraph()()()()
Fires an OnClearingGraph event.
(Inherited from BaseGraph.)
Clone(String)
Duplicates a graph. The new graph will use the same model and backend as the other Open transaction data will not be cloned.
(Overrides BaseGraph.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.
(Overrides BaseGraph.CloneAndAssignNames()()()().)
CreateEmptyEquivalent(String)
Creates an empty graph using the same model and backend as the other.
(Overrides BaseGraph.CreateEmptyEquivalent(String).)
Custom(array<Object>[]()[][])
Does graph-backend dependent stuff.
(Overrides BaseGraph.Custom(array<Object>[]()[][]).)
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.

edgesByTypeHeads
An array containing one head of a doubly-linked ring-list for each edge type indexed by the type ID.

EnsureSufficientIsomorphySpacesForParallelizedMatchingAreAvailable(Int32)
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)

FreeVisitedFlag(Int32)
Frees a visited flag. This is a safe but O(n) operation, as it resets the visited flag in the graph.
(Overrides BaseGraph.FreeVisitedFlag(Int32).)
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.
(Overrides BaseGraph.FreeVisitedFlagNonReset(Int32).)
GetAllocatedVisitedFlags()()()()
Returns the ids of the allocated visited flags.
(Overrides BaseGraph.GetAllocatedVisitedFlags()()()().)
GetCompatibleEdges(EdgeType)
Enumerates all edges compatible to the given edge type.
(Overrides BaseGraph.GetCompatibleEdges(EdgeType).)
GetCompatibleNodes(NodeType)
Enumerates all nodes compatible to the given node type.
(Overrides BaseGraph.GetCompatibleNodes(NodeType).)
GetEdge(Int32)
Gets the edge for the given id. Only available if the unique index was declared in the model.
(Overrides BaseGraph.GetEdge(Int32).)
GetEdgeType(String)
Returns the edge type with the given name.
(Inherited from BaseGraph.)
GetExactEdges(EdgeType)
Enumerates all edges with the exact given edge type.
(Overrides BaseGraph.GetExactEdges(EdgeType).)
GetExactNodes(NodeType)
Enumerates all nodes with the exact given node type.
(Overrides BaseGraph.GetExactNodes(NodeType).)
GetGraphElement(Int32)
Gets the graph element for the given unique id. Only available if the unique index was declared in the model.
(Overrides BaseGraph.GetGraphElement(Int32).)
GetNextGraphName()()()()
GetNode(Int32)
Gets the node for the given unique id. Only available if the unique index was declared in the model.
(Overrides BaseGraph.GetNode(Int32).)
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.
(Overrides BaseGraph.GetNumCompatibleEdges(EdgeType).)
GetNumCompatibleNodes(NodeType)
Returns the number of nodes compatible to the given node type.
(Overrides BaseGraph.GetNumCompatibleNodes(NodeType).)
GetNumExactEdges(EdgeType)
Returns the number of edges with the exact given edge type.
(Overrides BaseGraph.GetNumExactEdges(EdgeType).)
GetNumExactNodes(NodeType)
Returns the number of nodes with the exact given node type.
(Overrides BaseGraph.GetNumExactNodes(NodeType).)
graphID
GraphId (Overrides BaseGraph.GraphId.)
HasSameStructure(IGraph) (Overrides BaseGraph.HasSameStructure(IGraph).)
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!
(Overrides BaseGraph.HasSameStructure(IDictionary<(Of <<'(IGraph, SetValueType>)>>)).)
indices
Indices
The indices associated with the graph.
(Overrides BaseGraph.Indices.)
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)

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)

InitializeGraph(IGraphModel)
Initializes the graph with the given model.

IsInternallyVisited(IGraphElement)
Returns whether the given graph element has been internally visited. (Used for computing reachability.)
(Overrides BaseGraph.IsInternallyVisited(IGraphElement).)
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.)
(Overrides BaseGraph.IsInternallyVisited(IGraphElement, Int32).)
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.)
(Overrides BaseGraph.IsIsomorph(IGraph).)
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!
(Overrides BaseGraph.IsIsomorph(IDictionary<(Of <<'(IGraph, SetValueType>)>>)).)
IsVisited(IGraphElement, Int32)
Returns whether the given graph element has been visited.
(Overrides BaseGraph.IsVisited(IGraphElement, Int32).)
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

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.

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.
(Overrides BaseGraph.Merge(INode, INode, String).)
model
Model
The model associated with the graph.
(Overrides BaseGraph.Model.)
MoveHeadAfter(LGSPNode)
Moves the type list head of the given node after the given node. Part of the "list trick".

MoveHeadAfter(LGSPEdge)
Moves the type list head of the given edge after the given edge. Part of the "list trick".

Name
A name associated with the graph.
(Overrides BaseGraph.Name.)
nameOfSingleElementAdded
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.

nodesByTypeHeads
An array containing one head of a doubly-linked ring-list for each node type indexed by the type ID.

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

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

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.

RedirectingEdge(IEdge)
Fires an OnRedirectingEdge event.
(Inherited from BaseGraph.)
RedirectSource(LGSPEdge, LGSPNode, String)
Changes the source node of the edge from the old source to the given new source.

RedirectSource(IEdge, INode, String)
Changes the source node of the edge from the old source to the given new source.
(Overrides BaseGraph.RedirectSource(IEdge, INode, String).)
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.

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.
(Overrides BaseGraph.RedirectSourceAndTarget(IEdge, INode, INode, String, String).)
RedirectTarget(LGSPEdge, LGSPNode, String)
Changes the target node of the edge from the old target to the given new target.

RedirectTarget(IEdge, INode, String)
Changes the target node of the edge from the old target to the given new target.
(Overrides BaseGraph.RedirectTarget(IEdge, INode, String).)
Remove(INode)
Removes the given node from the graph.
(Overrides BaseGraph.Remove(INode).)
Remove(IEdge)
Removes the given edge from the graph.
(Overrides BaseGraph.Remove(IEdge).)
RemoveEdges(INode)
Removes all edges from the given node.
(Overrides BaseGraph.RemoveEdges(INode).)
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.

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.

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.

ResetVisitedFlag(Int32)
Resets the visited flag with the given ID on all graph elements, if necessary.
(Overrides BaseGraph.ResetVisitedFlag(Int32).)
Retype(LGSPNode, NodeType)
Retypes a node by creating a new node of the given type. All incident edges as well as all attributes from common super classes are kept.

Retype(INode, NodeType) (Overrides BaseGraph.Retype(INode, NodeType).)
Retype(LGSPEdge, EdgeType)
Retypes an edge by replacing it by a new edge of the given type. Source and target node as well as all attributes from common super classes are kept.

Retype(IEdge, EdgeType) (Overrides BaseGraph.Retype(IEdge, EdgeType).)
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.
(Overrides BaseGraph.ReuseOptimization.)
SetInternallyVisited(IGraphElement, Boolean)
Sets the internal-use visited flag of the given graph element. (Used for computing reachability.)
(Overrides BaseGraph.SetInternallyVisited(IGraphElement, Boolean).)
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.)
(Overrides BaseGraph.SetInternallyVisited(IGraphElement, Boolean, Int32).)
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.
(Overrides BaseGraph.SetVisited(IGraphElement, Int32, Boolean).)
statistics
Stores the statistics about the last analyze pass of the graph

ToString()()()() (Overrides Object.ToString()()()().)
uniquenessEnsurer
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.

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

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