From 99a72cdb451d1b9d95b040c7144dfd5adb9b6bd8 Mon Sep 17 00:00:00 2001
From: Romain Vuillemot <romain.vuillemot@gmail.com>
Date: Mon, 2 Dec 2024 15:11:36 +0100
Subject: [PATCH] Update README.md

---
 README.md | 14 ++++++--------
 1 file changed, 6 insertions(+), 8 deletions(-)

diff --git a/README.md b/README.md
index d83f530..68d1ee6 100644
--- a/README.md
+++ b/README.md
@@ -157,7 +157,7 @@ lectures](https://gitlab.ec-lyon.fr/rvuillem/algo-bsc/-/tree/main/lectures): sli
 
 ---
 
-### Lecture 8 - **Trees**
+### Lecture 8 and 9 - **Trees**
 
 - Data structures (arrays, adjacency lists)
 - Tree properties checks
@@ -173,16 +173,17 @@ lectures](https://gitlab.ec-lyon.fr/rvuillem/algo-bsc/-/tree/main/lectures): sli
 </details>
 
 
-### Lab 8 - **Exercises**
+### Lab 8 and 9 - **Exercises**
 
 ---
 
-### Lecture 9 - **Graphs**
+### Lecture 10 and 11- **Graphs**
 
  - Introduction to graphs (vertices and edges)
  - Types of graphs (directed, weighted)
  - Graphs data structures (adjacency matrix, adjacency list)
  - Graph properties (connectivity, cycles)
+- Graph traversal algorithms (depth-first search, breadth-first search)
 
 <details>
 <summary>📖 </summary>
@@ -199,11 +200,7 @@ lectures](https://gitlab.ec-lyon.fr/rvuillem/algo-bsc/-/tree/main/lectures): sli
 
 ---
 
-### Lecture 10 - **Graphs algorithms (1/2)**
 
-- Minimum spanning tree algorithms (Prim & Kruskal algorithms)
-- Topological sorting
-- Graph traversal algorithms (depth-first search, breadth-first search)
 
 <details>
 <summary>📖 </summary>
@@ -252,4 +249,5 @@ Exercices to practice:
 Other ressources:
 
 - https://en.wikibooks.org/wiki/Algorithms/
-- List of [computer science books](https://freecomputerbooks.com/compscAlgorithmBooks.html)
\ No newline at end of file
+- List of [computer science books](https://freecomputerbooks.com/compscAlgorithmBooks.html)
+- https://pyvideo.org/ 
\ No newline at end of file
-- 
GitLab