OrderedEdge

com.phasmidsoftware.gryphon.adjunct.OrderedEdge

case class OrderedEdge[V](from: V, to: V) extends DirectedEdge[V, Unit]

Represents a directed edge in a graph connecting two vertices of type V. This implementation specifically models directed edges for graph structures, where the direction is indicated from a from vertex to a to vertex. The edge carries no additional attributes.

Type parameters

V: the type of the vertices connected by the edge.

Value parameters

from: the originating vertex of the edge.
to: the terminating vertex of the edge.

Attributes

Graph
Supertypes: trait Serializable

trait Product

trait Equals

trait DirectedEdge[V, Unit]

trait Edge[V, Unit]

trait Connexion[V]

trait Attribute[Unit]

class Object

trait Matchable

class Any
Show all

Members list

Value members

Concrete methods

Retrieves the ending vertex of the edge. See NOTE above for white.

Attributes

Returns: the vertex where the edge terminates (the "black" vertex).

Retrieves the starting Vertex of this Edge. If this is an UndirectedEdge, white and black represent the nominal direction. Individual adjacencies can be based on a flipped version of an UndirectedEdge.

Attributes

Returns: the vertex where the edge originates (the "white" vertex).

Inherited methods

Returns the type of the edge represented by this object.

Attributes

Returns: the edge type, which is always Directed for this implementation.
Inherited from:: DirectedEdge

An iterator over the names of all the elements of this product.

Attributes

Inherited from:: Product

An iterator over all the elements of this product.

Attributes

Returns: in the default implementation, an Iterator[Any]
Inherited from:: Product

Concrete fields

Retrieves the attribute of type A associated with this instance.

Attributes

Returns: the attribute of type A representing the defining characteristic or property of this instance.

In this article

Generated with