Fix typos

learn22coding · Nov 1, 2020 · 0e3e1b8 · 0e3e1b8
1 parent b7731aa
commit 0e3e1b8
Show file tree

Hide file tree

Showing 5 changed files with 5 additions and 5 deletions.
diff --git a/content/geometry/DelaunayTriangulation.h b/content/geometry/DelaunayTriangulation.h
@@ -4,7 +4,7 @@
  * Source: Geometry in C
  * Description: Computes the Delaunay triangulation of a set of points.
  *  Each circumcircle contains none of the input points.
- *  If any three points are colinear or any four are on the same circle, behavior is undefined.
+ *  If any three points are collinear or any four are on the same circle, behavior is undefined.
  * Status: stress-tested
  * Time: O(n^2)
  */

diff --git a/content/geometry/HullDiameter.h b/content/geometry/HullDiameter.h
@@ -4,7 +4,7 @@
  * License: Boost Software License
  * Source: https://codeforces.com/blog/entry/48868
  * Description: Returns the two points with max distance on a convex hull (ccw,
- * no duplicate/colinear points).
+ * no duplicate/collinear points).
  * Status: Stress-tested, submitted on kattis roberthood
  */
 #pragma once

diff --git a/content/geometry/LineHullIntersection.h b/content/geometry/LineHullIntersection.h
@@ -3,7 +3,7 @@
  * Date: 2019-05-07
  * License: Boost Software License
  * Source: https://github.com/AlCash07/ACTL/blob/master/include/actl/geometry/algorithm/intersect/line_convex_polygon.hpp
- * Description: Line-convex polygon intersection. The polygon must be ccw and have no colinear points.
+ * Description: Line-convex polygon intersection. The polygon must be ccw and have no collinear points.
  * lineHull(line, poly) returns a pair describing the intersection of a line with the polygon:
  *  \begin{itemize*}
  *    \item $(-1, -1)$ if no collision,

diff --git a/content/geometry/PointInsideHull.h b/content/geometry/PointInsideHull.h
@@ -4,7 +4,7 @@
  * License: CC0
  * Source: https://github.com/ngthanhtrung23/ACM_Notebook_new
  * Description: Determine whether a point t lies inside a convex hull (CCW
- * order, with no colinear points). Returns true if point lies within
+ * order, with no collinear points). Returns true if point lies within
  * the hull. If strict is true, points on the boundary aren't included.
  * Usage:
  * Status: stress-tested

diff --git a/content/graph/chapter.tex b/content/graph/chapter.tex
@@ -55,6 +55,6 @@ \section{Math}
 
 	\subsection{Erdős–Gallai theorem}
 		% Source: https://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93Gallai_theorem
-		% Test: stress-tests/graph/matrix-tree.cpp
+		% Test: stress-tests/graph/erdos-gallai.cpp
 		A simple graph with node degrees $d_1 \ge \dots \ge d_n$ exists iff $d_1 + \dots + d_n$ is even and for every $k = 1\dots n$,
 		\[ \sum _{i=1}^{k}d_{i}\leq k(k-1)+\sum _{i=k+1}^{n}\min(d_{i},k). \]