Merge branch 'master' of gram.cse.buffalo.edu:ODIn/Website

src/teaching/cse-250/2022fa/index.erb

@@ -316,6 +316,8 @@ schedule:
     - date: 10/05/22
       topic: "Graphs; Graph ADTs"
       dow: Wed
+      section_a:
+        slides: slide/lec16a.pdf
       section_b:
         slides: slide/15b-Graphs.html
     - date: 10/07/22

src/teaching/cse-250/2022fa/slide/13b-AverageQueueStack.erb

@@ -26,6 +26,10 @@ textbook: Ch. 15, Ch. 7
   <p class="fragment">... but this isn't really representative of typical behavior</p>
 </section>
 
+<section>
+  <p>Let's talk probabilities</p>
+</section>
+
 <section>
   <p>If $X$ represents a random (numerical) outcome, the average over all possibilities is the <i>expectation</i> of $X$, or $E[X]$</p>
 

src/teaching/cse-250/2022fa/slide/15b-Graphs.erb

@@ -523,16 +523,22 @@ attribution: Based on slides by Tamassa Goodrich
   <p class="fragment">What's the complexity? <b class="fragment">($O(m) = O(n^2)$)</b></p>
 </section>
 
+<section>
+  <h4 class="slide_title">Edge List</h4>
+  
+  <svg data-src="graphics/15b/edge_list.svg" width="700px"/>
+</section>
+
 <section>
   <h4 class="slide_title">Edge List Summary</h4>
   
   <ul>
-    <li>addEdge, addVertex: <b class="fragment">$O(1)$</b></li>
-    <li>removeEdge: <b class="fragment">$O(1)$</b></li>
-    <li>removeVertex: <b class="fragment">$O(m)$</b></li>
-    <li>vertex.incidentEdges: <b class="fragment">$O(m)$</b></li>
-    <li class="fragment">vertex.edgeTo: <b class="fragment">$O(m)$</b></li>
-    <li class="fragment"><b>Space Used</b>: $O(n) + O(m)$</li>
+    <li>addEdge, addVertex: <b class="fragment" data-fragment-index="1">$O(1)$</b></li>
+    <li>removeEdge: <b class="fragment" data-fragment-index="2">$O(1)$</b></li>
+    <li>removeVertex: <b class="fragment" data-fragment-index="4">$O(m)$</b></li>
+    <li>vertex.incidentEdges: <b class="fragment" data-fragment-index="3">$O(m)$</b></li>
+    <li class="fragment" data-fragment-index="5">vertex.edgeTo: <b class="fragment" data-fragment-index="6">$O(m)$</b></li>
+    <li class="fragment" data-fragment-index="7"><b>Space Used</b>: $O(n) + O(m)$</li>
   </ul>
 </section>
 
@@ -667,12 +673,6 @@ attribution: Based on slides by Tamassa Goodrich
   <p class="fragment">What's the complexity?</p>
 </section>
 
-<section>
-  <h4 class="slide_title">Adjacency List</h4>
-  
-  <svg data-src="graphics/15b/adjacency_list.svg" width="700px"/>
-</section>
-
 <section>
   <h4 class="slide_title">Adjacency List Summary</h4>