LGSPEdgeWithUniqueId Class

Instantiates an LGSPEdgeWithUniqueId object.

Indexer that gives access to the attributes of the graph element.

The edge which replaced this edge (Valid is false in this case) or null, if this edge has not been replaced or is still a valid member of a graph.

The element which replaced this element (Valid is false in this case) or null, if this element has not been replaced or is still a valid member of a graph.

The source node of the edge.

The target node of the edge.

The EdgeType of the edge.

This is true, if this edge is a valid graph element, i.e. it is part of a graph.

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 edge. All attributes will be transfered to the new edge. The edge will not be associated to a graph, yet. So it will not have any assigned variables.

Creates a deep copy of this edge (i.e. (transient) class objects will be replicated). All attributes will be transfered to the new edge. The edge will not be associated to a graph, yet. So it will not have 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.

Gets the unique id of the edge. 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.

Retrieves the other incident node of this edge.

Recycles this edge. This may pool the edge 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.

Sets source and target to the LGSPEdge object instantiated before with source and target being null.

Returns the name of the type of this edge.

contains some booleans coded as bitvector

next edge in the incoming list of the target node containing all of its incoming edges

previous edge in the incoming list of the target node containing all of its incoming edges

next edge in the outgoing list of the source node containing all of its outgoing edges

previous edge in the outgoing list of the source node containing all of its outgoing edges

source node of this edge

target node of this edge

The EdgeType of the edge.

Next edge in the list containing all the edges of one type. See comment for lgspTypePrev (this edge has been retyped if typeNext is not null but typePrev is null).

Previous edge in the list containing all the edges of one type. The edge is not part of a graph, iff typePrev is null. If typePrev is null and typeNext is not null, this edge has been retyped and typeNext points to the new edge. These special cases are neccessary to handle the following situations: "delete node + return edge", "hom + delete + return", "hom + retype + return", "hom + retype + delete", "hom + retype + delete + return".

contains a unique id