| undirectedEdge-class {giRaph} | R Documentation |
Class for undirected edges
Objects can be created by calls of the form new("undirectedEdge", ...)
which admit short-hands of the form u(...).
.Data:"vector"
storing strictly positive numbers that refer to a given "vertexSet" object
Class "edge", directly.
Class "integer", from data part.
Class "vector", by class "integer".
Class "numeric", by class "integer".
signature(.Object = "undirectedEdge"):
constructs an undirected edge from a vector of strictly positive integerssignature(object = "undirectedEdge"):
displays an undirected edge as numbers joined by linessignature(object = "undirectedEdge",code="vertexSet"):
displays an undirected edge as names joined by linessignature(x = "undirectedEdge", y = "undirectedEdge"):
x and y are the same undirected edge if they are the same set of numberssignature(x = "undirectedEdge", y = "edge"):
always returns FALSE, as two edges of different kind are never the samesignature(x = "edge", y = "undirectedEdge"):
always returns FALSE, as two edges of different kind are never the samesignature(x = "undirectedEdge"): extracts an undirected edgesignature(from = "vector", to = "undirectedEdge"): constructs an undirected edge from vector inputsignature(from = "directedEdge", to = "undirectedEdge"): makes a directed edge undirectedsignature(x="undirectedEdge"): gets the maximum numeric identifier of an undirected edgesignature(object = "undirectedEdge",src="vertexSet",dst="vertexSet"):
recodes an undirected edge by making its numbers refer to another "vertexSet" objectThe constructor will try to handle any vector input by silently transforming it into a list of strictly positive integers.
Jens Henrik Badsberg, Claus Dethlefsen, Luca La Rocca
edge-class,
directedEdge-class,
edgeList-class and
u.