diff --git a/crates/ruma-state-res/src/lib.rs b/crates/ruma-state-res/src/lib.rs
index 93b0ddc9..2e12ab50 100644
--- a/crates/ruma-state-res/src/lib.rs
+++ b/crates/ruma-state-res/src/lib.rs
@@ -274,7 +274,7 @@ where
     // Vec of nodes that have zero out degree, least recent events.
     let mut zero_outdegree = vec![];
 
-    for (node, edges) in graph.iter() {
+    for (node, edges) in graph {
         if edges.is_empty() {
             // The `Reverse` is because rusts `BinaryHeap` sorts largest -> smallest we need
             // smallest -> largest