pub fn is_dag<'a, N: 'a, E: 'a, Ty, Ix>(g: &'a Graph<N, E, Ty, Ix>) -> bool
where
    Ty: EdgeType,
    Ix: petgraph::graph::IndexType,
{
    return g.is_directed() && !is_cyclic_directed(g);
}
/// Checks if provided Graph is a DAG or not
Checks if provided Graph is a DAG or not
Checks if provided Graph is a DAG or not
pub fn is_dag<'a, N: 'a, E: 'a, Ty, Ix>(g: &'a Graph<N, E, Ty, Ix>) -> bool
where
    Ty: EdgeType,
    Ix: petgraph::graph::IndexType,
{
    return g.is_directed() && !is_cyclic_directed(g);
}
pub fn is_dag < ' a , N : ' a , E : ' a , Ty , Ix > ( g : & ' a Graph < N , E , Ty , Ix > ) -> bool where Ty : EdgeType , Ix : petgraph :: graph :: IndexType , { return g . is_directed ( ) && ! is_cyclic_directed ( g ) ; }
Checks if provided Graph is a DAG or not
Checks if provided Graph is a DAG or not
g
&'a Graph<N, E, Ty, Ix>