Class dg.FactorEdge
The class for the bipartite graph edges between vertices and factors.
vertex.indices:Object of class "numeric",
see also "dg.Edge".
If the index is positiv then the node is a vertex,
else it is the factor vertex.
width:Object of class "numeric",
see "dg.Edge".
dash:Object of class "character",
see "dg.Edge".
color:Object of class "character",
see "dg.Edge".
label:Object of class "character",
see "dg.Edge".
label.position:Object of class "numeric",
see "dg.Edge".
Class "dg.Node", directly.
Class "dg.Edge", directly.
signature(object = "dg.FactorEdge"):
Extract the types ("super classes": "Vertex" or "Factor")
of the vertices (nodes) of the edge.
The method new also accepts the argument vertices or
vertexList. The label is then extracted from these vertices.
The length of vertices should match vertex.indices, where
vertex.indices is used to select vertices form vertexList.
Jens Henrik Badsberg
vertices <- returnVertexList(paste("V", 1:4, sep = ""))
factor <- new("dg.FactorVertex", vertex.indices = 1:3,
vertexList = vertices)
factoredge <- new("dg.FactorEdge", vertex.indices = c(1, -1),
vertices = new("dg.VertexList", list(vertices[[1]], factor)))
str(factoredge)
color(factoredge)
label(factoredge)
labelPosition(factoredge)
width(factoredge)
nodeIndicesOfEdge(factoredge)
nodeTypesOfEdge(factoredge)
color(factoredge) <- "Black"
label(factoredge) <- "V1~V1:2:3"
labelPosition(factoredge) <- c(0, 1, 2)
width(factoredge) <- 1
nodeIndicesOfEdge(factoredge) <- c(1, -1)
str(factoredge)Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.