/// Creates an iterator over `PackageLink` instances.
///
/// If the iteration is in forward order, for any given package, at least one link where the
/// package is on the `to` end is returned before any links where the package is on the
/// `from` end.
///
/// If the iteration is in reverse order, for any given package, at least one link where the
/// package is on the `from` end is returned before any links where the package is on the `to`
/// end.
///
/// ## Cycles
///
/// The links in a dependency cycle may be returned in arbitrary order.
Creates an iterator over `PackageLink` instances.
If the iteration is in forward order, for any given package, at least one link where the
package is on the `to` end is returned before any links where the package is on the
`from` end.

If the iteration is in reverse order, for any given package, at least one link where the
package is on the `from` end is returned before any links where the package is on the `to`
end.
Creates an iterator over ` PackageLink ` instances . If the iteration is in forward order for any given package at least one link where the package is on the ` to ` end is returned before any links where the package is on the ` from ` end . If the iteration is in reverse order for any given package at least one link where the package is on the ` from ` end is returned before any links where the package is on the ` to ` end .
pub fn links<'a>(
        &'a self,
        direction: DependencyDirection,
    ) -> impl Iterator<Item = PackageLink<'g>> + 'a {
        let graph = self.graph.0;
        self.core
            .links(graph.dep_graph(), graph.sccs(), direction)
            .map(move |(source_ix, target_ix, edge_ix)| {
                PackageLink::new(graph, source_ix, target_ix, edge_ix, None)
            })
    }
pub fn links < ' a > ( & ' a self , direction : DependencyDirection , ) -> impl Iterator < Item = PackageLink < ' g > > + ' a { let graph = self . graph . 0 ; self . core . links ( graph . dep_graph ( ) , graph . sccs ( ) , direction ) . map ( move | ( source_ix , target_ix , edge_ix ) | { PackageLink :: new ( graph , source_ix , target_ix , edge_ix , None ) } ) }
Creates an iterator over `PackageLink` instances.
Creates an iterator over ` PackageLink ` instances .
&'a self
direction
DependencyDirection
cycles
The links in a dependency cycle may be returned in arbitrary order.
The links in a dependency cycle may be returned in arbitrary order .