|
23 | 23 | Various core functions from the \link[network]{network} package, with specialized extensions for handling dynamic data. |
24 | 24 | } |
25 | 25 | \usage{ |
26 | | -get.edgeIDs.active(x, v, onset = NULL, terminus = NULL, length = NULL, at = NULL, |
| 26 | +\method{get.edgeIDs}{active}(x, v, onset = NULL, terminus = NULL, length = NULL, at = NULL, |
27 | 27 | alter = NULL, neighborhood = c("out", "in", "combined"), |
28 | 28 | rule = c("any", "all", "earliest", "latest"), na.omit = TRUE, active.default = TRUE) |
29 | | -get.edges.active(x, v, onset = NULL, terminus = NULL, length = NULL, at = NULL, |
| 29 | +\method{get.edges}{active}(x, v, onset = NULL, terminus = NULL, length = NULL, at = NULL, |
30 | 30 | alter = NULL, neighborhood = c("out", "in", "combined"), |
31 | 31 | rule = c("any", "all", "earliest", "latest"), na.omit = TRUE, active.default = TRUE) |
32 | | -get.neighborhood.active(x, v, onset = NULL, terminus = NULL, length = NULL, at = NULL, |
| 32 | +\method{get.neighborhood}{active}(x, v, onset = NULL, terminus = NULL, length = NULL, at = NULL, |
33 | 33 | type = c("out", "in", "combined"), rule = c("any", "all", "earliest", "latest"), |
34 | 34 | na.omit = TRUE, active.default = TRUE) |
35 | 35 |
|
36 | | -is.adjacent.active(x, vi, vj, onset = NULL, terminus = NULL, length = NULL, at = NULL, |
| 36 | +\method{is.adjacent}{active}(x, vi, vj, onset = NULL, terminus = NULL, length = NULL, at = NULL, |
37 | 37 | rule = c("any", "all", "earliest", "latest"), na.omit = FALSE, active.default = TRUE) |
38 | 38 |
|
39 | 39 | \method{network.dyadcount}{active}(x, onset = NULL, terminus = NULL, length = NULL, at = NULL, |
|
0 commit comments