///
/// A live edge is an edge for the current RunToken of a Node, regardless of whether the Node is
/// currently running.
///
/// "Live" edges are a superset of "running" edges: see `running_edge_predicate`
///
A live edge is an edge for the current RunToken of a Node, regardless of whether the Node is
currently running.

"Live" edges are a superset of "running" edges: see `running_edge_predicate`
A live edge is an edge for the current RunToken of a Node regardless of whether the Node is currently running . " Live " edges are a superset of " running " edges : see ` running_edge_predicate `
fn live_edge_predicate<'a>(inner: &'a InnerGraph<N>) -> impl Fn(EdgeId) -> bool + 'a {
    move |edge_id| {
      let (edge_src_id, _) = inner.pg.edge_endpoints(edge_id).unwrap();
      // Only include the edge if it is live.
      inner.pg[edge_id].1 == inner.unsafe_entry_for_id(edge_src_id).run_token()
    }
  }
fn live_edge_predicate < ' a > ( inner : & ' a InnerGraph < N > ) -> impl Fn ( EdgeId ) -> bool + ' a { move | edge_id | { let ( edge_src_id , _ ) = inner . pg . edge_endpoints ( edge_id ) . unwrap ( ) ; // Only include the edge if it is live. inner . pg [ edge_id ] . 1 == inner . unsafe_entry_for_id ( edge_src_id ) . run_token ( ) } }
A live edge is an edge for the current RunToken of a Node, regardless of whether the Node is
currently running.
A live edge is an edge for the current RunToken of a Node regardless of whether the Node is currently running .
inner
&'a InnerGraph<N>