LGSPNodeWithUniqueId Methods

Executes the function method given by its name. Throws an exception if the method does not exists or the parameters are of wrong types.

Executes the procedure method given by its name. Throws an exception if the method does not exists or the parameters are of wrong types.

Creates a shallow clone of this node. All attributes will be transfered to the new node. The node will not be associated to a graph, yet. So it will not have any incident edges nor any assigned variables.

Creates a deep copy of this node (i.e. (transient) class objects will be replicated). All attributes will be transfered to the new node. The node will not be associated to a graph, yet. So it will not have any incident edges nor any assigned variables.

Returns the graph element attribute with the given attribute name. If the graph element type doesn't have an attribute with this name, a NullReferenceException is thrown.

Returns an IEnumerable<IEdge> over all incident edges with the same type or a subtype of the given type

Returns an IEnumerable<IEdge> over all incoming edges with the same type or a subtype of the given type

Returns an IEnumerable<IEdge> over all outgoing edges with the same type or a subtype of the given type

Returns an IEnumerable<IEdge> over all incident edges with exactly the given type

Returns an IEnumerable<IEdge> over all incoming edges with exactly the given type

Returns an IEnumerable<IEdge> over all outgoing edges with exactly the given type

Gets the unique id of the node. Only available if unique ids for nodes and edges were declared in the model (or implicitely switched on by parallelization or the declaration of some index).

Returns true, if the typed object is compatible to the given type.

Returns whether this and that are deeply equal, which means the scalar attributes are equal, the container attributes are memberwise deeply equal, and object attributes are deeply equal. (If types are unequal the result is false.) Visited objects are/have to be stored in the visited objects dictionary in order to detect shortcuts and cycles.

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

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

Recycles this node. This may pool the node or just ignore it.

Resets all graph element attributes to their initial values.

Sets the graph element attribute with the given attribute name to the given value. If the graph element type doesn't have an attribute with this name, a NullReferenceException is thrown.

Returns the name of the type of this node.