From: Matthew Fernandez <matthew.fernandez@gmail.com>
Date: Sun, 31 May 2020 18:39:21 +0000 (-0700)
Subject: fix some comment typos
X-Git-Tag: 2.44.1~13^2^2~3
X-Git-Url: https://granicus.if.org/sourcecode?a=commitdiff_plain;h=cf7006b7dd6501fed7330e23742b69431b5ebbb2;p=graphviz

fix some comment typos
---

diff --git a/lib/edgepaint/furtherest_point.c b/lib/edgepaint/furtherest_point.c
index 33d14613d..f604d3b18 100644
--- a/lib/edgepaint/furtherest_point.c
+++ b/lib/edgepaint/furtherest_point.c
@@ -95,7 +95,7 @@ void furtherest_point(int k, int dim, real *wgt, real *pts, real *center, real w
   ncandidates = 1;
 
   /* idea: maintain the current best point and best (largest) distance. check the list of candidate. Subdivide each into quadrants, if any quadrant gives better distance, update, and put on the candidate
-     list. If we can not prune a quadrant (a auadrant can be pruned if the distance of its center to the group of points pts, plus that from the center to the corner of the quadrant, is smaller than the best), we
+     list. If we can not prune a quadrant (a quadrant can be pruned if the distance of its center to the group of points pts, plus that from the center to the corner of the quadrant, is smaller than the best), we
      also put it down on the candidate list. We then recurse on the candidate list, unless the max level is reached. */
   while (level++ < max_level){ 
     if (Verbose > 10) {
@@ -193,15 +193,15 @@ void furtherest_point_in_list(int k, int dim, real *wgt, real *pts, QuadTree qt,
      width: the width of the root
      max_level: max level to go down
      usr_dist: the distance function. If NULL, assume Euclidean. If NULL, set to Euclidean.
-     argmax: on entry, if NULL, will be allocated, iotherwise must be an array of size >= dim which will hold the furtherest point. 
+     argmax: on entry, if NULL, will be allocated, otherwise must be an array of size >= dim which will hold the furtherest point. 
 
      Return: the point (argmax) furtherest away from the group, and the distance dist_max.
    */
 
   int ncandidates = 10, ncandidates_max = 10, ntmp;
-  QuadTree *candidates, *ctmp;/* a cadidate array of quadtrees */
+  QuadTree *candidates, *ctmp;/* a candidate array of quadtrees */
   int ncandidates2 = 10, ncandidates2_max = 10;
-  QuadTree *candidates2;/* a cadidate array of quadtrees */
+  QuadTree *candidates2;/* a candidate array of quadtrees */
   real distance;
   int level = 0;
   int i, ii, j, pruned;
@@ -227,7 +227,7 @@ void furtherest_point_in_list(int k, int dim, real *wgt, real *pts, QuadTree qt,
   ncandidates = 1;
 
   /* idea: maintain the current best point and best (largest) distance. check the list of candidate. Subdivide each into quadrants, if any quadrant gives better distance, update, and put on the candidate
-     list. If we can not prune a quadrant (a auadrant can be pruned if the distance of its center to the group of points pts, plus that from the center to the corner of the quadrant, is smaller than the best), we
+     list. If we can not prune a quadrant (a quadrant can be pruned if the distance of its center to the group of points pts, plus that from the center to the corner of the quadrant, is smaller than the best), we
      also put it down on the candidate list. We then recurse on the candidate list, unless the max level is reached. */
   while (level++ < max_level){ 
     if (Verbose > 10) {