List Dihedral Triples in a Graph
Given a list of edges between vertices,
compile a list of all
edges2vees(iedge, jedge, nvert=max(iedge, jedge), ..., check=TRUE)
- Integer vectors, of equal length, specifying the edges.
- Number of vertices in the network.
- Logical. Whether to check validity of input data.
Given a finite graph with
nvert vertices and with edges
iedge, jedge, this low-level function
j are joined by
an edge and
k are joined by an edge.
The interpretation of
iedge, jedge is that each successive
pair of entries specifies an edge in the graph.
The $k$th edge joins vertex
iedge[k] to vertex
jedge must be integers
from 1 to
- A 3-column matrix of integers, in which each row represents a triple of vertices, with the first vertex joined to the other two vertices.
i <- c(1, 2, 5, 5, 1, 4, 2) j <- c(2, 3, 3, 1, 3, 2, 5) edges2vees(i, j)