diff --git a/ib002/03-time-complexity/2021-03-31-extend.mdx b/ib002/03-time-complexity/2021-03-31-extend.mdx
index 0f05e2f..b1a7110 100644
--- a/ib002/03-time-complexity/2021-03-31-extend.mdx
+++ b/ib002/03-time-complexity/2021-03-31-extend.mdx
@@ -89,7 +89,7 @@ As we could observe in the example above, `extend` iterates over all of the elem
 Consider constructing of this list:
 
 <ThemedSVG
-  source="/files/ib002/extend/construction"
+  source="/files/ib002/time-complexity/extend/construction"
   alt="Rendered construction of the list"
 />
 
diff --git a/ib002/10-graphs/2022-04-30-bfs-tree.mdx b/ib002/10-graphs/2022-04-30-bfs-tree.mdx
index 0b5d880..32bb1aa 100644
--- a/ib002/10-graphs/2022-04-30-bfs-tree.mdx
+++ b/ib002/10-graphs/2022-04-30-bfs-tree.mdx
@@ -23,11 +23,11 @@ As we have talked on the seminar, if we construct from some vertex $u$ BFS tree
 
 Consider the following graph:
 
-<ThemedSVG source="/files/ib002/bfs-tree/bfs_graph" />
+<ThemedSVG source="/files/ib002/graphs/bfs-tree/bfs_graph" />
 
 We run BFS from the vertex $a$ and obtain the following BFS tree:
 
-<ThemedSVG source="/files/ib002/bfs-tree/bfs_tree" />
+<ThemedSVG source="/files/ib002/graphs/bfs-tree/bfs_tree" />
 
 Let's consider pair of vertices $e$ and $h$. For them we can safely lay, from the BFS tree, following properties: