From 204975eafc14233d09091c4774a8e1a566d06c4e Mon Sep 17 00:00:00 2001
From: THIRUMURUGAN <125580604+THIRU-1074@users.noreply.github.com>
Date: Fri, 6 Sep 2024 18:56:01 +0530
Subject: [PATCH] Updated clang-format to BipartiteTest.cpp

---
 test/BipartiteTest.cpp | 7 +++++--
 1 file changed, 5 insertions(+), 2 deletions(-)

diff --git a/test/BipartiteTest.cpp b/test/BipartiteTest.cpp
index 2cd6dd72..597d50c7 100644
--- a/test/BipartiteTest.cpp
+++ b/test/BipartiteTest.cpp
@@ -44,7 +44,8 @@ TEST(IsBipartiteTest, non_bipartite_graph) {
 
   CXXGraph::UndirectedEdge<int> edge1(1, node1, node2);
   CXXGraph::UndirectedEdge<int> edge2(2, node2, node3);
-  CXXGraph::UndirectedEdge<int> edge3(3, node3, node1);  // Forms a cycle of 3 nodes
+  CXXGraph::UndirectedEdge<int> edge3(3, node3,
+                                      node1);  // Forms a cycle of 3 nodes
 
   CXXGraph::T_EdgeSet<int> edgeSet;
   edgeSet.insert(make_shared<CXXGraph::UndirectedEdge<int>>(edge1));
@@ -54,7 +55,9 @@ TEST(IsBipartiteTest, non_bipartite_graph) {
   CXXGraph::Graph<int> graph(edgeSet);
 
   bool isBipartite = graph.isBipartite();
-  ASSERT_EQ(isBipartite, false);  // This graph has an odd-length cycle, so it's not bipartite
+  ASSERT_EQ(
+      isBipartite,
+      false);  // This graph has an odd-length cycle, so it's not bipartite
 }
 
 TEST(IsBipartiteTest, empty_graph) {