pub fn label_counts(&self) -> BTreeMap<usize, usize> {
        let mut hm = BTreeMap::new();
        for label in self.atoms.iter() {
            *hm.entry(*label).or_insert(0) += 1;
        }
        hm
    }
/// Returns a Dictionary with counts for all the node labels in this graph.
Returns a Dictionary with counts for all the node labels in this graph.
Returns a Dictionary with counts for all the node labels in this graph .
pub fn label_counts(&self) -> BTreeMap<usize, usize> {
        let mut hm = BTreeMap::new();
        for label in self.atoms.iter() {
            *hm.entry(*label).or_insert(0) += 1;
        }
        hm
    }
pub fn label_counts ( & self ) -> BTreeMap < usize , usize > { let mut hm = BTreeMap :: new ( ) ; for label in self . atoms . iter ( ) { * hm . entry ( * label ) . or_insert ( 0 ) += 1 ; } hm }
Returns a Dictionary with counts for all the node labels in this graph.
Returns a Dictionary with counts for all the node labels in this graph .
&self