diff --git a/README.md b/README.md
index 0a9093a..13e8080 100644
--- a/README.md
+++ b/README.md
@@ -17,7 +17,7 @@ implementations of graph-theoretical algorithms and utilities in rust.
     - [x] depth-first search
     - [ ] bidirectional search
     - [ ] a* search
-    - [ ] dijkstra's algorithm (bidirectionally?)
+    - [x] dijkstra's algorithm (bidirectionally?)
 - [ ] general concepts
     - [ ] hamilton paths and cycles
     - [ ] euler paths and cycles (hierholzer's algorithm)
@@ -54,4 +54,6 @@ implementations of graph-theoretical algorithms and utilities in rust.
 - [ ] 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`)
+- [ ] improve dijkstra (`BinaryHeap::retain` might be slow)
+- [ ] improve dijkstra (make bidirectional)