src/algorithms.rs

@@ -557,7 +557,6 @@ where
     None
 }
 
-// TODO: 'visited' is already encoded in 'predecessors', except for 'source', which is visited, but has no predecessor.
 /// Return data type for [`dfs`].
 pub struct DfsResult<V: Copy> {
     /// Vertex map indicating which vertices were visited during the search.

src/models/frozen_graph.rs

@@ -96,6 +96,7 @@ pub struct FrozenGraph {
 }
 
 impl FrozenGraph {
+    // TODO: Move this to a new FromGraph trait and adapt the MakeTestGraph impl to use helper functions like "fn fixture_empty<G: FromGraph>() -> G { G::from_graph(&AppendGraph::empty()).0 }".
     /// Creates a graph instance as a copy of another graph.
     ///
     /// Returns the copied graph instance and two mappings of the `source` graph vertices and edges