directedEdge-class: Class "directedEdge"
In giRaph: The giRaph package for graph representation in R

Class for directed edges

Objects can be created by calls of the form new("directedEdge", ...) which admit short-hands of the form d(...) and r(...).

.Data:: Object of class "list" storing strictly positive numbers that refer to a given "vertexSet" object

Class "edge", directly. Class "list", from data part. Class "vector", by class "list".

initialize: signature(.Object = "directedEdge"): constructs a directed edge from a list of strictly positive integers
show: signature(object = "directedEdge"): displays a directed edge as an ordered sequence of undirected edges joined by arrows (using numeric codes)
showRel: signature(object = "directedEdge",code="vertexSet"): displays a directed edge as an ordered sequence of undirected edges joined by arrows (using character names
areTheSame: signature(x = "directedEdge", y = "directedEdge"): x and y are the same directed edge if they are the same ordered sequence of undirected edges
[: signature(x = "directedEdge"): extracts a directed edge
[[: signature(x = "directedEdge"): extracts an undirected edge
card: signature(object= "directedEdge"): counts all vertices in a directed edge
coerce: signature(from = "vector", to = "directedEdge"): constructs a directed edge from vector input
coerce: signature(from = "undirectedEdge", to = "directedEdge"): directs an undirected edge
maxId: signature(x="directedEdge"): gets the maximum numeric identifier of a directed edge
recode: signature(object="directedEdge",src = "vertexSet", dst = "vertexSet"): recodes a directed edge by making its numbers refer to another "vertexSet" object