docs: cleanup some first line

Author: samueltardieu

src/undirected/cliques.rs

@@ -3,7 +3,8 @@
 use std::collections::HashSet;
 use std::hash::Hash;
 
-/// Algorithm for finding all maximal cliques in an undirected graph.
+/// Find all maximal cliques in an undirected graph.
+///
 /// That is, it lists all subsets of vertices with the two properties that each pair of vertices in
 /// one of the listed subsets is connected by an edge, and no listed subset can have
 /// any additional vertices added to it while preserving its complete connectivity.
@@ -32,7 +33,8 @@ where
     result
 }
 
-/// Algorithm for finding all maximal cliques in an undirected graph.
+/// Find all maximal cliques in an undirected graph.
+///
 /// That is, it lists all subsets of vertices with the two properties that each pair of vertices in
 /// one of the listed subsets is connected by an edge, and no listed subset can have
 /// any additional vertices added to it while preserving its complete connectivity.

src/undirected/connected_components.rs

@@ -9,6 +9,7 @@ use std::marker::PhantomData;
 use rustc_hash::{FxHashMap, FxHashSet};
 
 /// A connected component implementation for various generic types.
+///
 /// This structure is only useful if the default collections used by
 /// the various functions of the [`connected_components`](self) module
 /// do not fit your needs.