Fix broken link on Dijkstra exercise

Ooooscar · Jul 31, 2020 · c9c101c · c9c101c
1 parent 62d8999
commit c9c101c
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/src/Algorithms/Graphs/ShortestPaths/Dijkstra/DijkstraExerciseTemplate.tex b/src/Algorithms/Graphs/ShortestPaths/Dijkstra/DijkstraExerciseTemplate.tex
@@ -86,7 +86,7 @@
         %$CONNECTIONS$
     \end{tikzpicture}
 \end{center}
-a) Follow the \href{https://ossner.github.io/TUMGAD/src/Algorithms/Graphs/ShortestPaths/Dijkstra}{\underline{Algorithm of Dijkstra}} as covered in the lecture and find the shortest path from node $A$ to node $MAXCHAR$.\\
+a) Follow the \href{https://ossner.github.io/TUMGAD/src/Algorithms/Graphs/ShortestPaths/Dijkstra/Dijkstra}{\underline{Algorithm of Dijkstra}} as covered in the lecture and find the shortest path from node $A$ to node $MAXCHAR$.\\
 Note the algorithms priority queue after every step, as well as the changes made to the queue in the step.\\
 If nodes have equal priorities, the algorithm follows the node that was inserted first.\\
 \newpage

diff --git a/src/Algorithms/Graphs/ShortestPaths/Dijkstra/DijkstraSolutionTemplate.tex b/src/Algorithms/Graphs/ShortestPaths/Dijkstra/DijkstraSolutionTemplate.tex
@@ -86,7 +86,7 @@
         %$CONNECTIONS$
     \end{tikzpicture}
 \end{center}
-a) Follow the \href{https://ossner.github.io/TUMGAD/src/Algorithms/Graphs/ShortestPaths/Dijkstra}{\underline{Algorithm of Dijkstra}} as covered in the lecture and find the shortest path from node $A$ to node $MAXCHAR$.\\
+a) Follow the \href{https://ossner.github.io/TUMGAD/src/Algorithms/Graphs/ShortestPaths/Dijkstra/Dijkstra}{\underline{Algorithm of Dijkstra}} as covered in the lecture and find the shortest path from node $A$ to node $MAXCHAR$.\\
 Note the algorithms priority queue after every step, as well as the changes made to the queue in the step.\\
 If nodes have equal priorities, the algorithm follows the node that was inserted first.\\
 \newpage