Click or drag to resize

IGraph Interface

An attributed, typed and directed multigraph with multiple inheritance on node and edge types.

Namespace:  de.unika.ipd.grGen.libGr
Assembly:  libGr (in libGr.dll) Version: GrGen.NET 4.5
Syntax
C#
public interface IGraph

The IGraph type exposes the following members.

Properties
  NameDescription
Public propertyBackend
The backend that created the graph
Public propertyChangesCounter
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.
Public propertyEdges
Enumerates all edges in the graph.
Public propertyGraphId
A unique id associated with the graph
Public propertyIndices
The indices associated with the graph.
Public propertyModel
The model associated with the graph.
Public propertyName
A name associated with the graph.
Public propertyNodes
Enumerates all nodes in the graph.
Public propertyNumEdges
The total number of edges in the graph.
Public propertyNumNodes
The total number of nodes in the graph.
Public propertyReuseOptimization
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.
Top
Methods
  NameDescription
Public methodAddEdge(IEdge)
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.
Public methodAddEdge(EdgeType, INode, INode)
Adds a new edge to the graph.
Public methodAddNode(INode)
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!
Public methodAddNode(NodeType)
Adds a new node to the graph.
Public methodAllocateVisitedFlag
Allocates a visited flag on the graph elements.
Public methodCanonize
Returns a canonical representation of the graph as a string
Public methodChangedEdgeAttribute
Fires an OnChangedEdgeAttribute event. For debugging, won't be automatically called in case of -nodebugevents, attribute change rollback is based on the pre-events.
Public methodChangedNodeAttribute
Fires an OnChangedNodeAttribute event. For debugging, won't be automatically called in case of -nodebugevents, attribute change rollback is based on the pre-events.
Public methodChangingEdgeAttribute
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.
Public methodChangingNodeAttribute
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.
Public methodCheck
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.
Public methodClear
Removes all nodes and edges from the graph (so any variables pointing to them start dangling).
Public methodClone
Duplicates a graph. The new graph will use the same model and backend as the other.
Public methodCloneAndAssignNames
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.
Public methodCreateEmptyEquivalent
Creates an empty graph using the same model and backend as the other.
Public methodCustom
Does graph-backend dependent stuff.
Public methodFreeVisitedFlag
Frees a visited flag. This is a safe but O(n) operation, as it resets the visited flag in the graph.
Public methodFreeVisitedFlagNonReset
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.
Public methodGetAllocatedVisitedFlags
Returns the ids of the allocated visited flags.
Public methodGetCompatibleEdges
Enumerates all edges compatible to the given edge type.
Public methodGetCompatibleNodes
Enumerates all nodes compatible to the given node type.
Public methodGetEdge
Gets the edge for the given id. Only available if the unique index was declared in the model.
Public methodGetExactEdges
Enumerates all edges with the exact given edge type.
Public methodGetExactNodes
Enumerates all nodes with the exact given node type.
Public methodGetGraphElement
Gets the graph element for the given unique id. Only available if the unique index was declared in the model.
Public methodGetNode
Gets the node for the given unique id. Only available if the unique index was declared in the model.
Public methodGetNumCompatibleEdges
Returns the number of edges compatible to the given edge type.
Public methodGetNumCompatibleNodes
Returns the number of nodes compatible to the given node type.
Public methodGetNumExactEdges
Returns the number of edges with the exact given edge type.
Public methodGetNumExactNodes
Returns the number of nodes with the exact given node type.
Public methodHasSameStructure(IGraph)
Returns whether this graph is isomorph to that graph, neglecting the attribute values, only structurally
Public methodHasSameStructure(IDictionaryIGraph, 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!
Public methodIsInternallyVisited(IGraphElement)
Returns whether the given graph element has been internally visited. (Used for computing reachability.)
Public methodIsInternallyVisited(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.)
Public methodIsIsomorph(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.)
Public methodIsIsomorph(IDictionaryIGraph, 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!
Public methodIsVisited
Returns whether the given graph element has been visited.
Public methodMerge
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.
Public methodRedirectSource
Changes the source node of the edge from the old source to the given new source.
Public methodRedirectSourceAndTarget
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.
Public methodRedirectTarget
Changes the target node of the edge from the old target to the given new target.
Public methodRemove(IEdge)
Removes the given edge from the graph.
Public methodRemove(INode)
Removes the given node from the graph. There must be no edges left incident to the node (you may use RemoveEdges to ensure this).
Public methodRemoveEdges
Removes all edges from the given node.
Public methodResetVisitedFlag
Resets the visited flag with the given ID on all graph elements, if necessary.
Public methodRetype(IEdge, EdgeType)
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.
Public methodRetype(INode, 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.
Public methodSetInternallyVisited(IGraphElement, Boolean)
Sets the internal-use visited flag of the given graph element. (Used for computing reachability.)
Public methodSetInternallyVisited(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.)
Public methodSetVisited
Sets the visited flag of the given graph element.
Public methodValidate
Checks whether a graph meets the connection assertions.
Top
Events
  NameDescription
Public eventOnChangedEdgeAttribute
Fired after an attribute of an edge is changed; for debugging purpose. Note for LGSPBackend: Because graph elements of the LGSPBackend don't know their graph a call to LGSPGraphElement.SetAttribute will not fire this event. If you use this function and want the event to be fired, you have to fire it yourself using ChangedEdgeAttributes.
Public eventOnChangedNodeAttribute
Fired after an attribute of a node is changed; for debugging purpose. Note for LGSPBackend: Because graph elements of the LGSPBackend don't know their graph a call to LGSPGraphElement.SetAttribute will not fire this event. If you use this function and want the event to be fired, you have to fire it yourself using ChangedNodeAttributes.
Public eventOnChangingEdgeAttribute
Fired before an attribute of an edge is changed. Note for LGSPBackend: Because graph elements of the LGSPBackend don't know their graph a call to LGSPGraphElement.SetAttribute will not fire this event. If you use this function and want the event to be fired, you have to fire it yourself using ChangingEdgeAttributes.
Public eventOnChangingNodeAttribute
Fired before an attribute of a node is changed. Note for LGSPBackend: Because graph elements of the LGSPBackend don't know their graph a call to LGSPGraphElement.SetAttribute will not fire this event. If you use this function and want the event to be fired, you have to fire it yourself using ChangingNodeAttributes.
Public eventOnClearingGraph
Fired before the whole graph is cleared
Public eventOnEdgeAdded
Fired after an edge has been added
Public eventOnNodeAdded
Fired after a node has been added
Public eventOnRedirectingEdge
Fired before an edge is redirected (causing removal then adding again). The edge to be redirected is provided to the handler.
Public eventOnRemovingEdge
Fired before an edge is deleted
Public eventOnRemovingEdges
Fired before all edges of a node are deleted
Public eventOnRemovingNode
Fired before a node is deleted
Public eventOnRetypingEdge
Fired before the type of an edge is changed. Old and new edges are provided to the handler.
Public eventOnRetypingNode
Fired before the type of a node is changed. Old and new nodes are provided to the handler.
Public eventOnSettingAddedEdgeNames
Fired before each rewrite step (also rewrite steps of subpatterns) to indicate the names of the edges added in this rewrite step in order of addition.
Public eventOnSettingAddedNodeNames
Fired before each rewrite step (also rewrite steps of subpatterns) to indicate the names of the nodes added in this rewrite step in order of addition.
Public eventOnSettingVisited
Fired before a visited flag is set.
Public eventOnVisitedAlloc
Fired after a visited flag was allocated.
Public eventOnVisitedFree
Fired after a visited flag was freed.
Top
See Also