LGSPNamedGraph Class

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

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

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

Copy constructor.

Constructs an LGSPNamedGraph object with the given model and capacity, and an automatically generated name.

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

Copy constructor.

Constructs an LGSPNamedGraph object with the given model, name, and capacity.

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.

The graph-backend dependent commands that are available, and a description of each command.

The global variables of the graph rewrite system; convenience access to save parameter passing.

The indices associated with the graph.

The model associated with the graph.

A name associated with the graph.

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.

The uniqueness handler associated with the graph.

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!

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!

Allocates a visited flag on the graph elements.

Analyzes the graph. The calculated data is used to generate good searchplans for the current graph.

Returns a canonical representation of the graph as a string

Checks if the given edge is already available in its type ringlist

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

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

Checks if the given node is already available in its type ringlist

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

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

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

Fires an OnClearingGraph event.

Duplicates a graph, assigning names. The new graph will use the same model as the other Open transaction data will not be cloned.

Does graph-backend dependent stuff.

returns whether another element than the one given already bears the name

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

Fires an OnEdgeAdded event.

Frees a visited flag. This is a safe but O(n) operation, as it resets the visited flag in the graph.

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.

Returns the ids of the allocated visited flags.

Enumerates all edges compatible to the given edge type.

Enumerates all nodes compatible to the given node type.

Gets the edge for the given id. Only available if the unique index was declared in the model.

Returns the edge type with the given name.

Enumerates all edges with the exact given edge type.

Enumerates all nodes with the exact given node type.

Gets the graph element for the given unique id. Only available if the unique index was declared in the model.

Returns the graph from the set of graphs given that is isomorphic to this graph (including the attribute values), or null if no such graph exists 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!

Gets the node for the given unique id. Only available if the unique index was declared in the model.

Returns the node type with the given name.

Returns the number of edges compatible to the given edge type.

Returns the number of nodes compatible to the given node type.

Returns the number of edges with the exact given edge type.

Returns the number of nodes with the exact given node type.

Returns the graph from the set of graphs given that is isomorphic to this graph (neglecting the attribute values, only structurally), or null if no such graph exists Don't call from a parallelized matcher!

Returns whether this graph is isomorph to that graph, neglecting the attribute values, only structurally The other graph we check for isomorphy against, neglecting attribute values

Return Value

Type: 
true if that is isomorph (regarding structure) to this, false otherwise

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!

Returns whether the given graph element has been internally visited. (Used for computing reachability.)

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.)

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.)

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!

Returns whether the given graph element has been visited.

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.

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.

Moves the type list head of the given edge after the given edge. Part of the "list trick".

Moves the type list head of the given node after the given node. Part of the "list trick".

Fires an OnNodeAdded event.

Fires an OnObjectCreated event.

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.

Fires an OnRedirectingEdge event.

Changes the source node of the edge from the old source to the given new source.

Changes the source node of the edge from the old source to the given new source.

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.

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.

Changes the target node of the edge from the old target to the given new target.

Changes the target node of the edge from the old target to the given new target.

Removes all edges from the given node.

Fires an OnRemovingEdge event.

Fires an OnRemovingEdges event.

Fires an OnRemovingNode event.

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.

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.

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.

Resets the visited flag with the given ID on all graph elements, if necessary.

Fires an OnRetypingEdge event.

Fires an OnRetypingNode event.

Sets the internal-use visited flag of the given graph element. (Used for computing reachability.)

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.)

Fires an OnSettingVisited event.

Sets the visited flag of the given graph element.

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.

Fires an OnVisitedAlloc event.

Fires an OnVisitedFree event.

The number of edges for each edge type indexed by the type ID.

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

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)

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)

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)

Normally null, contains some data which allows for efficient graph comparison, in case this is a constant graph which was used for isomorphy checking

The number of nodes for each node type indexed by the type ID.

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

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

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

Stores the statistics about the last analyze pass of the graph