Apply suggestions from code review

Co-authored-by: Tim Pillinger <[email protected]>

src/7-to-8/major-changes/scheduling.rst

@@ -23,9 +23,8 @@ Cylc can manage infinite workflows of repeating tasks:
 
 Cylc 8 has a new scheduling algorithm that:
 
-- Is much more efficient because it doesn't need to track nearly as 
-  many waiting and succeeded tasks in addition to the active
-  (submitted and running) ones. 
+- Is much more efficient because it doesn't need to track as 
+  many waiting and succeeded tasks.
 
   - waiting tasks are not pre-spawned before they are needed
   - succeeded tasks are not retained across the :term:`active window`

src/glossary.rst

@@ -1739,7 +1739,7 @@ Glossary
       ahead of the oldest :term:`active cycle` the workflow is permitted
       to run.
 
-      The "oldest active cycle point" is the first cycle in the workflow to
+      The "oldest active cycle point" is the earliest cycle in the workflow to
       contain any submitted or running tasks.
 
       .. seealso::

src/user-guide/running-workflows/tasks-jobs-ui.rst

@@ -122,7 +122,7 @@ n=0:
    for a more detailed description.
 n=1:
    The ``n=1`` window contains the ``n=0`` window plus all tasks out to one
-   graph edge around them, i.e. their dependencies (the tasks that come immediately
+   graph edge around them, i.e. their parents (the tasks that come immediately
    before them in the graph) and their descendants (immediately after them in the
    graph).
 n=2: