feat: don't reference FI MU subjects by their codes

Signed-off-by: Matej Focko <mfocko@redhat.com>

static/files/algorithms/graphs/bfs-tree/bfs_graph.dot

@@ -14,4 +14,4 @@ graph {
     d -- h
 
     h -- j
-}
+}

static/files/algorithms/graphs/bfs-tree/bfs_graph_with_additional_edge.dot

@@ -15,4 +15,4 @@ graph {
     d -- h
 
     h -- j
-}
+}

static/files/algorithms/graphs/bfs-tree/bfs_tree.dot

@@ -10,4 +10,4 @@ digraph {
     b -> h
 
     i -> d
-}
+}

static/files/algorithms/graphs/bfs-tree/bfs_tree_with_additional_edge.dot

@@ -9,4 +9,4 @@ digraph {
     e -> j
 
     i -> d
-}
+}

static/files/algorithms/rb-trees/rules/rb.dot

@@ -44,4 +44,4 @@ digraph {
     "Node(value=6, rank=0)" -> "nil9"
     "Node(value=9, rank=0)" -> "nil10"
     "Node(value=9, rank=0)" -> "nil11"
-}
+}

static/files/algorithms/rb-trees/rules/rb_height.dot

@@ -44,4 +44,4 @@ digraph {
     "Node(value=6, rank=0)" -> "nil9"
     "Node(value=9, rank=0)" -> "nil10"
     "Node(value=9, rank=0)" -> "nil11"
-}
+}

static/files/algorithms/rb-trees/rules/red-node-black-children/correct.dot

@@ -31,4 +31,4 @@ digraph {
     "Node(value=4, rank=0)" -> "nil7"
     "Node(value=7, rank=0)" -> "nil8"
     "Node(value=7, rank=0)" -> "nil9"
-}
+}

static/files/algorithms/rb-trees/rules/red-node-black-children/incorrect.dot

@@ -6,7 +6,7 @@ digraph {
     "Node(value=0, rank=0)" [label="0"]; #done
     "Node(value=2, rank=0)" [label="2"]; #done
     "Node(value=5, rank=1)" [label="5"]; #done
-    
+
 
     "nil2" [label="", color=none]
     "nil3" [label="", color=none]
@@ -34,7 +34,7 @@ digraph {
     "Node(value=4, rank=0)" -> "nil7"
     "Node(value=7, rank=0)" -> "nil8"
     "Node(value=7, rank=0)" -> "8" [color="red"]
-    
+
     "8" -> "nil9"
     "8" -> "nil10"
-}
+}

static/files/algorithms/recursion/karel-1/maze666.kw

@@ -27,4 +27,4 @@ W 5 5 E
 W 5 6 E
 
 W 6 3 N
-W 6 3 S
+W 6 3 S

static/files/algorithms/recursion/karel-1/maze_skel.kw

@@ -31,4 +31,4 @@ W 5 4 E
 W 5 5 N
 W 5 6 E
 
-W 6 4 N
+W 6 4 N

static/files/algorithms/recursion/pyramid-slide-down/BottomUp.java

@@ -52,4 +52,4 @@ public class BottomUp {
                 { 4, 62, 98, 27, 23, 9, 70, 98, 73, 93, 38, 53, 60, 4, 23 },
         }) == 1074 ? "passed" : "failed");
     }
-}
+}

static/files/algorithms/recursion/pyramid-slide-down/Greedy.java

@@ -44,4 +44,4 @@ public class Greedy {
                 { 4, 62, 98, 27, 23, 9, 70, 98, 73, 93, 38, 53, 60, 4, 23 },
         }) == 1074 ? "passed" : "failed");
     }
-}
+}

static/files/algorithms/recursion/pyramid-slide-down/Naive.java

@@ -45,4 +45,4 @@ public class Naive {
                 { 4, 62, 98, 27, 23, 9, 70, 98, 73, 93, 38, 53, 60, 4, 23 },
         }) == 1074 ? "passed" : "failed");
     }
-}
+}

static/files/algorithms/recursion/pyramid-slide-down/TopDown.java

@@ -73,4 +73,4 @@ public class TopDown {
                 { 4, 62, 98, 27, 23, 9, 70, 98, 73, 93, 38, 53, 60, 4, 23 },
         }) == 1074 ? "passed" : "failed");
     }
-}
+}

static/files/algorithms/time-complexity/extend/construction.dot

@@ -22,4 +22,4 @@ digraph G {
     d_node -> "7"
     d_node -> "8"
     d_node -> "9"
-}
+}