reword

SageMathOER-CCC · Jan 5, 2025 · 5bbf38d · 5bbf38d
1 parent 58c1e45
commit 5bbf38d
Show file tree

Hide file tree

Showing 2 changed files with 5 additions and 5 deletions.
diff --git a/source/relations/ch-relations.ptx b/source/relations/ch-relations.ptx
@@ -5,7 +5,7 @@
 
   <introduction>
     <p>
-      In this chapter, we will explore the relationships between elements in sets, building upon the concept of "Cartesian product" introduced earlier. We will begin by learning how to visualize relations using Sage. Then, we will introduce some new functions that can help us determine whether these relations are equivalence or partial order relations.
+      In this chapter, we will explore the relationships between elements in sets, building upon the concept of the Cartesian product introduced earlier. We will begin by learning how to visualize relations using Sage. Then, we will introduce some new functions that can help us determine whether these relations are equivalence or partial order relations.
     </p>
   </introduction>
 

diff --git a/source/trees/sec-trees-in-action.ptx b/source/trees/sec-trees-in-action.ptx
@@ -23,12 +23,12 @@
                 </li>
                 <li>
                     <p>
-                        Make a Graph of the CCC campuses. Each location is a node. Each railway path is an edge. Each railway path is the shortest path between locations. The weight of the edges represents the distance between locations.
+                        Make a graph of the CCC campuses. Each location is a node. Each railway path is an edge. Each railway path is the shortest path between locations. The weight of the edges represents the distance between locations.
                     </p>
                 </li>
                 <li>
                     <p>
-                        Find the minimum spanning tree (MST) of the CCC Graph.
+                        Find the minimum spanning tree (MST) of the CCC graph.
                     </p>
                 </li>
             </ol>
@@ -48,7 +48,7 @@
                     <cell>(41.88609733324964, -87.62682604591349)</cell>
                 </row>
                 <row>
-                    <cell>Harry S Truman College</cell>
+                    <cell>Harry Truman College</cell>
                     <cell>(41.9646769664519, -87.65901943241516)</cell>
                 </row>
                 <row>
@@ -126,7 +126,7 @@
             </input>
         </sage>
         <p>
-            Now we can make an edge <c>list</c>. We will represent each campus as a node with the initials of the college name. The weight of the edge will represent the Haversine value between the locations. For example, express the route between Harold Washington College and Harry S Truman College as <c>("HW", "HT", Haversine)</c>.
+            Now we can make an edge <c>list</c>. We will represent each campus as a node with the initials of the college name. The weight of the edge will represent the Haversine value between the locations. For example, express the route between Harold Washington College and Harry Truman College as <c>("HW", "HT", Haversine)</c>.
         </p>
         <sage>
             <input>