Function sinks

pub fn sinks<'a, G>(g: &'a G) -> impl 'a + Iterator<Item = G::NodeId>
where
    G: IntoNeighborsDirected + NodeCount + NodeIndexable,

Produce an iterator yielding IDs for all sink nodes within the graph.

A node is considered to be a sink node if it has no outgoing edges.