From 72510a9475684af7a23c4ce8e6922ebae51e91b1 Mon Sep 17 00:00:00 2001
From: Dipankar Purecha <dipupurecha01@gmail.com>
Date: Tue, 28 Nov 2023 18:30:45 +0100
Subject: [PATCH] Fix formatting

---
 test/test_max_clique.cpp | 21 ++++++++++++++-------
 1 file changed, 14 insertions(+), 7 deletions(-)

diff --git a/test/test_max_clique.cpp b/test/test_max_clique.cpp
index 70fcef0..9fee062 100644
--- a/test/test_max_clique.cpp
+++ b/test/test_max_clique.cpp
@@ -18,7 +18,8 @@ TEST_CASE("Three Connected Graph") {
 
     SECTION("Max clique of threeConnectedGraph is") {
         auto vertices = threeConnected.maxClique();
-        auto verticesEstimate = threeConnected.maxClique(AlgorithmAccuracy::APPROXIMATE);
+        auto verticesEstimate =
+            threeConnected.maxClique(AlgorithmAccuracy::APPROXIMATE);
         REQUIRE(vertices.size() == 3);
         REQUIRE(verticesEstimate.size() == 3);
     }
@@ -34,7 +35,8 @@ TEST_CASE("Four Connected Graph") {
 
     SECTION("Max clique of fourConnectedGraph is") {
         auto vertices = fourConnected.maxClique();
-        auto verticesEstimate = fourConnected.maxClique(AlgorithmAccuracy::APPROXIMATE);
+        auto verticesEstimate =
+            fourConnected.maxClique(AlgorithmAccuracy::APPROXIMATE);
 
         REQUIRE(vertices.size() == 4);
         REQUIRE(verticesEstimate.size() == 4);
@@ -51,7 +53,8 @@ TEST_CASE("Disconnected Graph with 4 vertices") {
 
     SECTION("Max cliques of disconnectedGraph are") {
         auto vertices = disconnectedGraph.maxClique();
-        auto verticesEstimate = disconnectedGraph.maxClique(AlgorithmAccuracy::APPROXIMATE);
+        auto verticesEstimate =
+            disconnectedGraph.maxClique(AlgorithmAccuracy::APPROXIMATE);
 
         REQUIRE(vertices.size() == 2);
         REQUIRE(verticesEstimate.size() == 2);
@@ -68,7 +71,8 @@ TEST_CASE("Singleton Vertex in graph with 4 vertices") {
 
     SECTION("Max cliques of singletonGraph are") {
         auto vertices = singletonGraph.maxClique();
-        auto verticesEstimate = singletonGraph.maxClique(AlgorithmAccuracy::APPROXIMATE);
+        auto verticesEstimate =
+            singletonGraph.maxClique(AlgorithmAccuracy::APPROXIMATE);
 
         REQUIRE(vertices.size() == 2);
         REQUIRE(verticesEstimate.size() == 2);
@@ -89,7 +93,8 @@ TEST_CASE("Large Disconnected Graph with Multiple Components") {
 
     SECTION("Max cliques of largeDisconnectedGraph are") {
         auto vertices = largeDisconnectedGraph.maxClique();
-        auto verticesEstimate = largeDisconnectedGraph.maxClique(AlgorithmAccuracy::APPROXIMATE);
+        auto verticesEstimate =
+            largeDisconnectedGraph.maxClique(AlgorithmAccuracy::APPROXIMATE);
 
         REQUIRE(vertices.size() == 2);
         REQUIRE(verticesEstimate.size() == 2);
@@ -107,7 +112,8 @@ TEST_CASE("Singleton Vertex in Large Connected Graph") {
 
     SECTION("Max cliques of singletonLargeGraph are") {
         auto vertices = singletonLargeGraph.maxClique();
-        auto verticesEstimate = singletonLargeGraph.maxClique(AlgorithmAccuracy::APPROXIMATE);
+        auto verticesEstimate =
+            singletonLargeGraph.maxClique(AlgorithmAccuracy::APPROXIMATE);
 
         REQUIRE(vertices.size() == 2);
         REQUIRE(verticesEstimate.size() == 2);
@@ -130,7 +136,8 @@ TEST_CASE("Graph with 10 Vertices and Max Clique Size of 5") {
 
     SECTION("Max clique of tenVerticesGraph is") {
         auto vertices = tenVerticesGraph.maxClique();
-        auto verticesEstimate = tenVerticesGraph.maxClique(AlgorithmAccuracy::APPROXIMATE);
+        auto verticesEstimate =
+            tenVerticesGraph.maxClique(AlgorithmAccuracy::APPROXIMATE);
 
         REQUIRE(vertices.size() == 5);
         REQUIRE(verticesEstimate.size() == 5);