update readme

README.md

@@ -15,17 +15,19 @@ my notes and implementation (in rust) of some algorithms in:
 
 graphs are represented with adjancency list, currently (with two usize Vecs in Rust)
 > at the moment: parallel edges aren't allowed
-
+>
 > at the moment: self-loops aren't allowed
 
    1. [undirected graph](./src/graph/undirected_graph.rs)
-      1. [breadth-first search BFS](./src/graph/undirected_graph.rs#L89-L106)
-      2. [undirected connected componenets UCC](./src/graph/undirected_graph.rs#L129-L154)
+      1. [breadth-first search BFS](./src/graph/undirected_graph.rs#L80-L102)
+      2. [undirected connected componenets UCC](./src/graph/undirected_graph.rs#L163-L189)
+      3. [depth first search](./src/graph/undirected_graph.rs#L203-L224)
+      4. [dijkstra](./src/graph/undirected_graph.rs#L272-L316)
    2. [directed graph](./src/graph/directed_graph.rs)
-      1. depth-first search DFS ([iterative](./src/graph/directed_graph.rs#L88-L106) & [recursive](./src/graph/directed_graph.rs#L117-L129))
-      2. [Topo Sort](./src/graph/directed_graph.rs#L143-L153)
-
+      1. depth-first search DFS ([iterative](./src/graph/directed_graph.rs#L57-L80) & [recursive](./src/graph/directed_graph.rs#L119-L123))
+      2. [Topo Sort](./src/graph/directed_graph.rs#L190-L219)
+      3. [kosaraju](./src/graph/directed_graph.rs#L357-L373)
 
-TODO: 
+TODO:
 
-- [] track memory footprint
+- [ ] track memory footprint