mfocko/blog
1
0
Fork 0
mirror of https://github.com/mfocko/blog.git synced 2024-11-13 01:30:29 +01:00
Code Issues Projects Releases Packages Wiki Activity Actions

fix: update the links to the reorganized graphviz

Browse source 
Signed-off-by: Matej Focko <me@mfocko.xyz>
This commit is contained in:
Matej Focko 2023-09-06 18:20:09 +02:00
parent 9c9cb03731
commit 0dc4cdbea9
Signed by: mfocko
GPG key ID: 7C47D46246790496
2 changed files with 3 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
ib002/03-time-complexity/2021-03-31-extend.mdx
View file

@ -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"
/>

4
ib002/10-graphs/2022-04-30-bfs-tree.mdx
View file

@ -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: