View source: R/get.dyads.active.R
get.dyads.active | R Documentation |
Constructs a matrix, essentially an edgelist, of the pairs of vertices connected by edges active within the query spell.
get.dyads.active(nD, onset = NULL, terminus = NULL, length = NULL, at = NULL,
rule = c("any", "all", "earliest", "latest"), active.default = TRUE)
nD |
networkDynamic object to be queried |
onset |
optional numeric value giving onset time of query spell |
terminus |
optional numeric value giving terminus time of query spell |
length |
optional numeric value giving length (duration) of query spell |
at |
optional numeric value giving single time point to query |
rule |
a character string indicating the definition of "active" for this query: |
active.default |
logical; should elements without an activity attribute be regarded as active by default? Default to |
Uses is.active
internally. The ordering of matrix rows is arbitrary. The ordering of vertices in non-directed networks corresponds to how they were set in the data structure (i.e. does not enforce i > j) If no edges are active or exist, a matrix with zero rows will be returned.
Returns a two-column numeric matrix in which the first column gives a tail vertex.id and the second column gives the head vertex.id and each row corresponds to the existence of an active relationship between the vertices for the given query spell.
This function does not support hypergraphic networks.
skyebend
See also is.active
data(windsurfers)
get.dyads.active(windsurfers,onset=2,terminus=3)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.