INamedGraph Methods

Adds an existing IEdge 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.

Adds an existing edge to the graph, names it, and assigns it to the given variable.

Adds a new edge to the graph.

Adds a new named edge to the graph and assigns it to the given variable.

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

Adds a new node to the graph.

Adds an existing node to the graph and names it.

Adds a new named node to the graph.

Allocates a visited flag on the graph elements.

Returns a canonical representation of the graph as a string

Fires an OnChangedEdgeAttribute event. For debugging, won't be automatically called in case of -nodebugevents, attribute change rollback is based on the pre-events.

Fires an OnChangedNodeAttribute event. For debugging, won't be automatically called in case of -nodebugevents, attribute change rollback is based on the pre-events.

Fires an OnChangingEdgeAttribute event. To be called before changing an attribute of an edge, with exact information about the change to occur, to allow rollback of changes, in case a transaction is underway.

Fires an OnChangingNodeAttribute event. To be called before changing an attribute of a node, with exact information about the change to occur, to allow rollback of changes, in case a transaction is underway.

Fires an OnChangingObjectAttribute event. To be called before changing an attribute of an internal object, with exact information about the change to occur, to allow rollback of changes, in case a transaction is underway.

Checks whether the internal data structures are ok (will throw an exception if they are not). This is for debugging the underlying implementation from positions outside the implementation.

Removes all nodes and edges from the graph (so any variables pointing to them start dangling). Also resets the class object unique id source.

Duplicates a graph. The new graph will use the same model as the other.

Duplicates a graph. The new graph will use the same model as the other.

Duplicates a graph, assigning names. (Don't use this on a named graph.) The new graph will use the same model and backend as the other.

Duplicates a named graph. The new graph will use the same model as the other.

Creates an empty graph using the same model as the other.

Does graph-backend dependent stuff.

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.

Gets the graph element for the given name.

Returns the name for the given element.

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.

Gets the graph element for the given name.

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.

Gets the node for 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 isomorphic to that graph, neglecting the attribute values, only structurally

Returns whether this graph is isomorphic 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 isomorphic 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 isomorphic 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.

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 the given edge from the graph.

Removes the given node from the graph. There must be no edges left incident to the node (you may use RemoveEdges to ensure this).

Removes all edges from the given node.

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

Retypes an edge by creating a new edge of the given type. Source and target node as well as all attributes from common super classes are kept.

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.

Sets the name for a graph element. Any previous name will be overwritten.

Sets a name of the form prefix + number for the graph element, with number being the first number from 0 on yielding an element name not already available in the graph

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

Sets the visited flag of the given graph element.

Checks whether a graph meets the connection assertions.