diff --git a/README.md b/README.md
index d0e96af..0a9093a 100644
--- a/README.md
+++ b/README.md
@@ -9,12 +9,12 @@ implementations of graph-theoretical algorithms and utilities in rust.
 > NOTE: this library isn't complete at this point. only checked off points are implemented.
 
 - [x] model (bi-)directional graphs
-    - [x] representation: `(v, adj(e))` (adjacency matrix approach)
+    - [x] representation: `(v, adj(e))` (adjacency list approach)
     - [ ] representation: `(v, adj(e), w(e))` (weighted edges)
-    - [ ] macro: `graph! { ... }` (from adjacency matrix)
+    - [x] macro: `graph! { ... }` (from adjacency list)
 - [x] pathfinding
     - [x] breadth-first search
-    - [ ] depth-first search
+    - [x] depth-first search
     - [ ] bidirectional search
     - [ ] a* search
     - [ ] dijkstra's algorithm (bidirectionally?)
@@ -53,4 +53,5 @@ implementations of graph-theoretical algorithms and utilities in rust.
 - [ ] make vertex identities separate from vertex data
 - [ ] if useful, add `(V, inc(E))` representation (incidence matrix)
 - [ ] improve allocation size heuristic for queue, visited set, etc in search algos
+- [ ] improve iterator implementation (allow `for &vert in &g`)