From ef83af8370284463b7346ec903abf47e2394a8e9 Mon Sep 17 00:00:00 2001
From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Date: Mon, 8 Nov 2021 06:38:30 +0000
Subject: [PATCH] clang-format and clang-tidy fixes for ee4cb635

---
 geometry/graham_scan_algorithm.cpp | 14 +++++++-------
 1 file changed, 7 insertions(+), 7 deletions(-)

diff --git a/geometry/graham_scan_algorithm.cpp b/geometry/graham_scan_algorithm.cpp
index 00bb528a1..d24354e60 100644
--- a/geometry/graham_scan_algorithm.cpp
+++ b/geometry/graham_scan_algorithm.cpp
@@ -22,18 +22,18 @@
  * points be sorting them with respect to the bottom-most point. Once the points
  * are sorted, they form a simple closed path.
  * The sorting criteria is to use the orientation to compare angles without
- * actually computing them (See the compare() function below) because computation
- * of actual angles would be inefficient since trigonometric functions are not
- * simple to evaluate.
+ * actually computing them (See the compare() function below) because
+ *computation of actual angles would be inefficient since trigonometric
+ *functions are not simple to evaluate.
  *
  * Accept or Reject Points
  * Once we have the closed path, the next step is to traverse the path and
  * remove concave points on this path using orientation. The first two points in
  * sorted array are always part of Convex Hull. For remaining points, we keep
- * track of recent three points, and find the angle formed by them. Let the three
- * points be prev(p), curr(c) and next(n). If the orientation of these points
- * (considering them in the same order) is not counterclockwise, we discard c,
- * otherwise we keep it.
+ * track of recent three points, and find the angle formed by them. Let the
+ *three points be prev(p), curr(c) and next(n). If the orientation of these
+ *points (considering them in the same order) is not counterclockwise, we
+ *discard c, otherwise we keep it.
  *
  * @author [Lajat Manekar](https://github.com/Lazeeez)
  *