A base class for edges in a graph. This class does not store the vertex pair that comprises the edge; that functionality would need to be included in the derived class.
Return a copy of the edge. The default implementation assumes that no
semantic information is associated with each edge, and therefore
simply returns a new
Edge object. Note that the vertices are
not copied in this implementation.
True if two edges self and other are semantically
False if not. You should reimplement this
function in a derived class if your edges have semantic information.
Given a vertex that makes up part of the edge, return the other vertex.
ValueError if the given vertex is not part of the
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.