style(doc): remove extra indentation in list

src/directed/dijkstra.rs

@@ -260,7 +260,7 @@ where
 ///
 /// - `target` is reachable target.
 /// - `parents` is a map containing an optimal parent (and an associated
-///    cost which is ignored here) for every reachable node.
+///   cost which is ignored here) for every reachable node.
 ///
 /// This function returns a vector with a path from the farthest parent up to
 /// `target`, including `target` itself.

src/directed/topological_sort.rs

@@ -8,7 +8,7 @@ use std::mem;
 ///
 /// - `roots` is a collection of nodes that ought to be explored.
 /// - `successors` returns a list of successors for a given node, including possibly
-///    nodes that were not present in `roots`.
+///   nodes that were not present in `roots`.
 ///
 /// The function returns an acceptable topological order of nodes given as roots or
 /// discovered, or an error if a cycle is detected.