Fig. 2From: Computing multicast trees in dynamic networks and the complexity of connected components in evolving graphsEvolving digraph corresponding to the FSDN in Fig. 1. Edges are labeled with corresponding time-steps. Observe that \(CBF\) is not a valid journey since \(BF\) exists only in the past with respect to \(CB\)Back to article page