pub(crate) fn edge_rot_prev_iterator_(
        &self,
        edge_id: Option<EdgeIndex>,
    ) -> EdgeRotPrevIterator<'_, I, F> {
        EdgeRotPrevIterator::new(self, edge_id)
    }
/// Returns an edge iterator, the edges will all originate at the same vertex as 'edge_id'.
///  'edge_id' will be the first edge returned by the iterator.
/// Do *NOT* use this when altering next, prev or twin edges.
Returns an edge iterator, the edges will all originate at the same vertex as 'edge_id'.
'edge_id' will be the first edge returned by the iterator.
Do *NOT* use this when altering next, prev or twin edges.
Returns an edge iterator the edges will all originate at the same vertex as ' edge_id ' . ' edge_id ' will be the first edge returned by the iterator . Do * NOT * use this when altering next prev or twin edges .
pub(crate) fn edge_rot_prev_iterator_(
        &self,
        edge_id: Option<EdgeIndex>,
    ) -> EdgeRotPrevIterator<'_, I, F> {
        EdgeRotPrevIterator::new(self, edge_id)
    }
pub ( crate ) fn edge_rot_prev_iterator_ ( & self , edge_id : Option < EdgeIndex > , ) -> EdgeRotPrevIterator < ' _ , I , F > { EdgeRotPrevIterator :: new ( self , edge_id ) }
Returns an edge iterator, the edges will all originate at the same vertex as 'edge_id'.
Returns an edge iterator the edges will all originate at the same vertex as ' edge_id ' .
&self
edge_id
Option<EdgeIndex>