A trait representing a connection between two vertices in a graph structure. This trait is designed to generalize the concept of a connexion between exactly two vertices in a graph. The vertices are called white and black in order to avoid any suggestion of an order. NOTE: if you're curious why I use the archaic spelling "Connexion", see https://en.wikipedia.org/wiki/Connexion_(graph_theory)
Type parameters
V
the type representing the vertices connected by this edge. It could be any user-defined type that models a vertex.
Retrieves the blackVertex of this Connexion. If this is a DirectedEdge, this vertex represents the end. If this is an UndirectedEdge, see the note above for white.
Retrieves the blackVertex of this Connexion. If this is a DirectedEdge, this vertex represents the end. If this is an UndirectedEdge, see the note above for white.
Retrieves the whiteVertex of this Connexion. If this is a DirectedEdge, this vertex represents the start. If this is an UndirectedEdge, white to black represents the nominal direction. Individual adjacencies can be based on a flipped version of an UndirectedEdge.
Retrieves the whiteVertex of this Connexion. If this is a DirectedEdge, this vertex represents the start. If this is an UndirectedEdge, white to black represents the nominal direction. Individual adjacencies can be based on a flipped version of an UndirectedEdge.