diff --git a/files/Lec19_Maps2.pdf b/files/Lec19_Maps2.pdf
index b24da15..9f3a792 100644
Binary files a/files/Lec19_Maps2.pdf and b/files/Lec19_Maps2.pdf differ
diff --git a/notes/week13/class13B.md b/notes/week13/class13B.md
index 83d2a04..1d5ae80 100644
--- a/notes/week13/class13B.md
+++ b/notes/week13/class13B.md
@@ -1,40 +1,35 @@
 # Class Meeting 13B
 
-Today we will be try to find the shortest path through some graphs.
+Today we will be working on the Travelling Salesperson problem (the slides are the same as 13A).
 
 <div>
 <iframe src="../../Lec18_Maps.pdf" width="100%" height="600px" frameBorder="0"> </iframe>
 </div>
 
-[Download the Slides from today](https://github.com/ubc-cs/cpsc203/raw/main/files/Lec18_Maps.pdf)
+[Download the Slides from today](https://github.com/ubc-cs/cpsc203/raw/main/files/Lec19_Maps2.pdf)
 
+<!-- 
 ## Important links for today:
 
 - [Solving Dijkstra's Algorithm](https://algo-dijkstra.vercel.app/index.html)
-- [Dijkstra's Algorithm](https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm)
-- [Graphical explanation of Dijkstra's algorithm](https://www.geeksforgeeks.org/dijkstras-shortest-path-algorithm-greedy-algo-7/)
-- [Another graphical explanation of Dijkstra's algorithm](https://www.freecodecamp.org/news/dijkstras-shortest-path-algorithm-visual-introduction/)
 
-<!-- 
 ## Optional links for today
 -->
 
 ## Logistics
 
-There is no repo to clone today!
-<!--
  1. Clone the Class Activity Repository
 
 You will first need to "accept" the GitHub Classroom assignment to get a copy of the starter code.
 
-You can do that by [clicking here](https://classroom.github.com/a/ZEaSSumI).
+You can do that by [clicking here](https://classroom.github.com/a/LXKH9ZuB).
 
 Then, clone the `classActivity1XY` repository by running the following line in your Terminal:
 
 ```
 git clone <your_clone_url>
 ``` 
--->
+
 
 ## Acknowledgements