fn add_vertex(&mut self) -> usize {
        let vertex_id = if let Some(reusable_id) = self.next_reusable_vertex_id() {
            reusable_id
        } else {
            self.vertex_count
        };

        self.map.insert(vertex_id, HashMap::new());

        self.vertex_count += 1;

        vertex_id
    }
/// Adds a vertex to the storage.
///
/// # Returns
/// Unique id of the newly added vertex.
///
/// # Complexity
/// O(|1|)
///
/// # Panics
/// If number of vertices exceeds the maximum value that `usize` can represent.
Adds a vertex to the storage.
Adds a vertex to the storage .
fn add_vertex(&mut self) -> usize {
        let vertex_id = if let Some(reusable_id) = self.next_reusable_vertex_id() {
            reusable_id
        } else {
            self.vertex_count
        };
        self.map.insert(vertex_id, HashMap::new());
        self.vertex_count += 1;
        vertex_id
    }
fn add_vertex ( & mut self ) -> usize { let vertex_id = if let Some ( reusable_id ) = self . next_reusable_vertex_id ( ) { reusable_id } else { self . vertex_count } ; self . map . insert ( vertex_id , HashMap :: new ( ) ) ; self . vertex_count += 1 ; vertex_id }
Adds a vertex to the storage.
Adds a vertex to the storage .
&mut self
Unique id of the newly added vertex.
Unique id of the newly added vertex .
&mut self
complexity
None
panics
If number of vertices exceeds the maximum value that `usize` can represent.
If number of vertices exceeds the maximum value that ` usize ` can represent .