A base class for vertices in a graph. Contains several connectivity values useful for accelerating isomorphism searches, as proposed by Morgan (1965).
||The number of nearest neighbors|
||The sum of the neighbors’ connectivity1 values|
||The sum of the neighbors’ connectivity2 values|
||An integer label used to sort the vertices|
Return a copy of the vertex. The default implementation assumes that no
semantic information is associated with each vertex, and therefore
simply returns a new
True if two vertices self and other are semantically
False if not. You should reimplement this
function in a derived class if your vertices have semantic information.
True if self is semantically more specific than other,
False if not. You should reimplement this function in a derived
class if your edges have semantic information.
Reset the cached structure information for this vertex.