Function dasp_graph::sources

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

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

A node is considered to be a source node if it has no incoming edges.