pub fn remove_unreachable_vertices(&mut self, head: usize) -> Result<()> {
        self.unreachable_vertices(head)?
            .iter()
            .for_each(|vertex| self.remove_vertex(*vertex).unwrap());
        Ok(())
    }
/// Removes all unreachable vertices from this graph.
/// Unreachable means that there is no path from head to the vertex.
Removes all unreachable vertices from this graph.
Unreachable means that there is no path from head to the vertex.
Removes all unreachable vertices from this graph . Unreachable means that there is no path from head to the vertex .
pub fn remove_unreachable_vertices(&mut self, head: usize) -> Result<()> {
        self.unreachable_vertices(head)?
            .iter()
            .for_each(|vertex| self.remove_vertex(*vertex).unwrap());
        Ok(())
    }
pub fn remove_unreachable_vertices ( & mut self , head : usize ) -> Result < ( ) > { self . unreachable_vertices ( head ) ? . iter ( ) . for_each ( | vertex | self . remove_vertex ( * vertex ) . unwrap ( ) ) ; Ok ( ( ) ) }
Removes all unreachable vertices from this graph.
Removes all unreachable vertices from this graph .
&mut self
head
usize
&mut self
head
usize