LGSPEdgeWithReferenceToContainingGraph Fields

points to the containing graph

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