update class 12B

_toc.yml

@@ -140,7 +140,7 @@ parts:
     sections:
       - file: notes/week12/videos
       - file: notes/week12/class12A
-#      - file: notes/week12/class12B
+      - file: notes/week12/class12B
 #       - file: notes/week08/homework
 #       - file: notes/week08/lecture
 #       - file: notes/week08/test

notes/week12/class12A.md

@@ -8,8 +8,6 @@ Today we will be working on understanding and exploring the Depth-first algorith
 
 [Download the Slides from today](https://github.com/ubc-cs/cpsc203/raw/main/files/Lec18_StateSpaces.pdf)
 
-
-
 ## Important links for today:
 
 - [Solve a Sudoku puzzle](https://www.sudokuonline.io/kids/numbers-4-4)

notes/week12/class12B.md

@@ -0,0 +1,39 @@
+# Class Meeting 12B
+
+Today we will be try to find the shortest path through some graphs.
+
+<div>
+<iframe src="../../Lec17_StateSpace.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)
+
+## Important links for today:
+
+- [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/)
+- [REALLY great example](https://www.youtube.com/watch?v=wsSEKm-rU6U)
+- [OSMNX reference](https://github.com/gboeing/osmnx-examples/tree/master/notebooks)
+- [Tutorial](https://gist.github.com/psychemedia/b49c49da365666ba9199d2e27d002d07)
+
+<!-- 
+## Optional links for today
+-->
+
+## Logistics
+
+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).
+
+Then, clone the `classActivity11A` repository by running the following line in your Terminal:
+
+```
+git clone <your_clone_url>
+```
+
+## Acknowledgements
+
+Slides for {{ COURSE_CODE }} were developed and created by [Dr. Cinda Heeren](https://www.cs.ubc.ca/people/cinda-heeren). The current iteration of the course resulted in minor adaptations and updates, but by in large, full credit of these slides belongs to Dr. Cinda Heeren.

notes/week12/videos.md

@@ -53,16 +53,16 @@ In the sidebar on the right, you can use the checklists to keep track of what's
 ### Thursday's class
 
 We'll continue the stuff from Tuesday on Thursday.
-<!-- 
-```{dropdown} 2. Graph Exploration
+
+```{dropdown} 4. Dijkstra's Algorithm
     :class-container: sd-shadow-lg
     :color: primary
     :open:
 
 <div class="container youtube">
-<iframe class="responsive-iframe" src="https://player.vimeo.com/video/920172396" frameborder="0" allow="accelerometer; autoplay="0"; gyroscope; picture-in-picture; fullscreen" allowfullscreen></iframe>
+<iframe class="responsive-iframe" src="https://player.vimeo.com/video/927565362" frameborder="0" allow="accelerometer; autoplay="0"; gyroscope; picture-in-picture; fullscreen" allowfullscreen></iframe>
 </div>
-``` -->
+```
 
 <!--