src/models/graph.rs

@@ -31,7 +31,7 @@ impl<'a> Iterator for VertexNeighborIterator<'a> {
     type Item = Vertex;
 
     fn next(&mut self) -> Option<Self::Item> {
-        // TODO: Benchmark storing full Index (one read, larger entries) vs slot + get_idx() (two reads, smaller entries).
+        // TODO: Benchmark storing full Index (one read, larger entries) vs. slot + get_idx() (two reads, smaller entries).
         let incidence = self.incidence?;
         let index = self.graph.incidences.get_idx(incidence.0)?;
         let entry = &self.graph.incidences[index];

src/traits.rs

@@ -1,5 +1,6 @@
 // TODO: Add functions to reserve memory for vertices and edges.
 // TODO: Add iterator of edges.
+// TODO: Split out GraphTopologyAddition trait.
 pub trait GraphTopology {
     type Vertex: Copy + Eq;
     type Edge;