Issue #644 ch9

pretext/Graphs/AnAdjacencyList.ptx

@@ -19,5 +19,8 @@
             to compactly represent a sparse graph. The adjacency list also allows us
             to easily find all the links that are directly connected to a particular
             vertex.</p>
+            <conclusion><p>
+                <!-- extra space before the progress bar -->
+            </p></conclusion>
     </section>
 

pretext/Graphs/AnAdjacencyMatrix.ptx

@@ -30,5 +30,8 @@
             is connected to every other vertex. There are few real problems that
             approach this sort of connectivity. The problems we will look at in this
             chapter all involve graphs that are sparsely connected.</p>
+            <conclusion><p>
+                <!-- extra space before the progress bar -->
+            </p></conclusion>
     </section>
 

pretext/Graphs/AnalysisofDijkstrasAlgorithm.ptx

@@ -11,5 +11,8 @@
             <c>for</c> loop is executed once for each edge in the
             graph, and within the <c>for</c> loop the call to <c>decreaseKey</c> takes
             time <m>O(E\log(V)).</m> So the combined running time is <m>O((V+E) \log(V)).</m></p>
+            <conclusion><p>
+                <!-- extra space before the progress bar -->
+            </p></conclusion>
     </section>
 

pretext/Graphs/BreadthFirstSearchAnalysis.ptx

@@ -20,5 +20,8 @@
         <p>Finally, at least for this problem, there is the time required to build
             the initial graph. We leave the analysis of the <c>buildGraph</c> function
             as an exercise for you.</p>
+            <conclusion><p>
+                <!-- extra space before the progress bar -->
+            </p></conclusion>
     </section>
 

pretext/Graphs/BuildingtheKnightsTourGraph.ptx

@@ -369,5 +369,8 @@ int main() {
 }
             </input></program>
         </listing>
+        <conclusion><p>
+            <!-- extra space before the progress bar -->
+        </p></conclusion>
 </section>
 

pretext/Graphs/BuildingtheWordLadderGraph.ptx

@@ -248,5 +248,8 @@ int main() {
             constructed by the <c>buildGraph</c> function has exactly 53,286 edges, so
             the matrix would have only 0.20% of the cells filled! That is a very
             sparse matrix indeed.</p>
+            <conclusion><p>
+                <!-- extra space before the progress bar -->
+            </p></conclusion>
     </section>
 

pretext/Graphs/DepthFirstSearchAnalysis.ptx

@@ -8,5 +8,8 @@
             recursively if the vertex is white, the loop will execute a maximum of
             once for every edge in the graph or <m>O(E)</m>. So, the total time
             for depth first search is <m>O(V + E)</m>.</p>
+            <conclusion><p>
+                <!-- extra space before the progress bar -->
+            </p></conclusion>
     </section>
 

pretext/Graphs/DijkstrasAlgorithm.ptx

@@ -196,5 +196,8 @@ def dijkstra(aGraph,start):
 
     </exercise>
 </reading-questions>  
+<conclusion><p>
+    <!-- extra space before the progress bar -->
+</p></conclusion>
   </section>
 

pretext/Graphs/DiscussionQuestions.ptx

@@ -171,5 +171,8 @@
                     algorithm?</p>
             </li>
         </ol></p>
+        <conclusion><p>
+            <!-- extra space before the progress bar -->
+        </p></conclusion>
     </section>
 

pretext/Graphs/GeneralDepthFirstSearch.ptx

@@ -344,5 +344,8 @@ main()
             <caption>DFS Visualization</caption>
             <video label="graphs_general_depth-dfs-vis-video" source="Graphs/vis_dfs.mp4" width="80%" preview="Graphs/vis_dfs_thumb.png" />
         </figure>
+        <conclusion><p>
+            <!-- extra space before the progress bar -->
+        </p></conclusion>
 
 </section>

pretext/Graphs/Glossary.ptx

@@ -142,5 +142,8 @@
                 </gi>
 
         </glossary>
+        <conclusion><p>
+            <!-- extra space before the progress bar -->
+        </p></conclusion>
     </section>
 

pretext/Graphs/Implementation.ptx

@@ -417,5 +417,8 @@ main()
                         </input></program></statement>
                 </task>
         </exploration>
+        <conclusion><p>
+                <!-- extra space before the progress bar -->
+            </p></conclusion>
 </section>
 

pretext/Graphs/ImplementingBreadthFirstSearch.ptx

@@ -434,4 +434,7 @@ int main() {
 }
             </input></program>
         </listing>
+        <conclusion><p>
+            <!-- extra space before the progress bar -->
+        </p></conclusion>
 </section>

pretext/Graphs/ImplementingKnightsTour.ptx

@@ -203,6 +203,8 @@ def knightTour(n,path,u,limit):
 <cline>    <area>done = True</area>:</cline>
 <cline><area>return done</area>:</cline>
 </areas></exercise>        </reading-questions>  
-
+    <conclusion><p>
+        <!-- extra space before the progress bar -->
+    </p></conclusion> 
     </section>
 

pretext/Graphs/KnightsTourAnalysis.ptx

@@ -184,5 +184,8 @@ def orderByAvail(n):
 
     </exercise>
 </reading-questions>
+<conclusion><p>
+    <!-- extra space before the progress bar -->
+</p></conclusion>
     </section>
 

pretext/Graphs/Matching.ptx

@@ -63,4 +63,7 @@
       </match>
     </matches>
   </exercise>
+  <conclusion><p>
+    <!-- extra space before the progress bar -->
+</p></conclusion>
 </section>

pretext/Graphs/Objectives.ptx

@@ -40,4 +40,7 @@
                 <description><p>Flowchart outlining the prerequisites for a Computer Science major. The chart begins with 'Math-151' leading into 'CS-220'. Below this, 'CS-150' points to 'CS-151', which in turn branches into 'CS-250' and 'CS-230'. 'CS-230' continues to 'CS-466', and 'CS-151' also points to 'CS-360', which then leads to 'CS-490'. Additionally, 'CS-360' branches off to 'CS-477'. Each course is represented as a node, and the arrows indicate the prerequisite relationship, where one course must be completed before moving on to the next.</p></description>
                 </image>
             </figure>
+            <conclusion><p>
+                <!-- extra space before the progress bar -->
+            </p></conclusion>
     </section>

pretext/Graphs/PrimsSpanningTreeAlgorithm.ptx

@@ -231,5 +231,8 @@ def prim(G,start):
 
     </exercise>
 </reading-questions>
+<conclusion><p>
+    <!-- extra space before the progress bar -->
+</p></conclusion>
 </section>
 

pretext/Graphs/ProgrammingExercises.ptx

@@ -41,5 +41,8 @@
                     river.</p>
             </li>
         </ol></p>
+        <conclusion><p>
+            <!-- extra space before the progress bar -->
+        </p></conclusion>
     </section>
 

pretext/Graphs/ShortestPathProblems.ptx

@@ -68,5 +68,8 @@ Routers from One Host to the Next over the Internet</pre>
             first search, except that here we are concerned with the total weight of
             the path rather than the number of hops in the path. It should be noted
             that if all the weights are equal, the problem is the same.</p>
+            <conclusion><p>
+                <!-- extra space before the progress bar -->
+            </p></conclusion>
     </section>
 

pretext/Graphs/StronglyConnectedComponents.ptx

@@ -131,5 +131,8 @@
                 <description><p>The diagram shows a directed graph illustrating the concept of strongly connected components within a network of nodes. Each node is labeled with a letter from A to I and a pair of numbers, which could represent the sequence in which a depth-first search algorithm processed them. The graph is organized with directed edges forming paths between the nodes, suggesting the presence of subgraphs where each node is reachable from every other node within the same subgraph. This kind of representation is commonly used in computer science to illustrate algorithms that identify strongly connected components within a graph, which are maximal sets of vertices with a path to every other vertex in the set.</p></description>
                 </image>
             </figure>
+            <conclusion><p>
+                <!-- extra space before the progress bar -->
+            </p></conclusion>
     </section>
 

pretext/Graphs/Summary.ptx

@@ -25,5 +25,8 @@
                 <p>Minimum weight spanning trees for broadcasting messages.</p>
             </li>
         </ul></p>
+        <conclusion><p>
+            <!-- extra space before the progress bar -->
+        </p></conclusion>
     </section>
 

pretext/Graphs/TheGraphAbstractDataType.ptx

@@ -55,5 +55,8 @@ Reading Question
 
 </exercise>
 </reading-questions>
+<conclusion><p>
+    <!-- extra space before the progress bar -->
+</p></conclusion>
 </section>
 

pretext/Graphs/TheKnightsTourProblem.ptx

@@ -26,5 +26,8 @@
                     visited exactly once.</p>
             </li>
         </ul></p>
+        <conclusion><p>
+            <!-- extra space before the progress bar -->
+        </p></conclusion>
     </section>
 

pretext/Graphs/TheWordLadderProblem.ptx

@@ -32,5 +32,8 @@ SAGE</pre>
                     efficient path from the starting word to the ending word.</p>
             </li>
         </ul></p>
+        <conclusion><p>
+            <!-- extra space before the progress bar -->
+        </p></conclusion>
     </section>
 

pretext/Graphs/TopologicalSorting.ptx

@@ -67,6 +67,8 @@
                 <description><p>Alt text for Figure 29: This image shows the result of a topological sort on a directed acyclic graph representing the steps for making pancakes. The sequence begins with "1 Tbl Oil" at step 17/18, followed by "1 egg" at step 15/16, "3/4 cup milk" at step 1/12, and "1 cup mix" at step 2/11. The next steps are "heat griddle" at step 13/14, "heat syrup" at step 9/10, "pour 1/4 cup" at step 3/8, and "turn when bubbly" at step 4/7. The final action is "eat" at step 5/6. Each step is depicted as an oval, connected by directed paths that indicate the order of operations, with numbers denoting the order in the topological sort.</p></description>
                 </image>
             </figure>
-
+            <conclusion><p>
+                <!-- extra space before the progress bar -->
+            </p></conclusion>
     </section>
 

pretext/Graphs/VocabularyandDefinitions.ptx

@@ -95,5 +95,8 @@
 
             </li>
         </dl>
+        <conclusion><p>
+            <!-- extra space before the progress bar -->
+        </p></conclusion>
     </section>