Does a breadth-first search from the specified set of vertices, respecting the direction and timing of edges. TODO: vertex activity.
forward.reachable(nd, v, start = NULL, end = NULL, per.step.depth = Inf)a network (usually a networkDynamic) object
numeric vector giving the set of initial vertex.ids to start from
The beginning of the time range to start from
End of the time range to search to
How many steps (default=1) to search per unit of time.
A numeric vector of vertex.ids reachable from the initial set of vertex.id by `traveling' forward in time along active vertices and edges subject to bounding paramters.
The default value of per.step.depth=Inf is equivilent to assuming that the `process' takes no time to travel along vertices
See also tPath for a dramatically faster implementation