updated is_brick()

Author: janmenjayap

src/sage/graphs/matching_covered_graph.py

@@ -2924,7 +2924,7 @@ def is_brick(self, coNP_certificate=False):
 
         # Find a nontrivial odd component
         if all(len(c) % 2 for c in components):
-            nontrivial_odd_component = next((c for c in components if len(c) > 1), None)
+            nontrivial_odd_component = next(c for c in components if len(c) > 1)
         else:
             nontrivial_odd_component = components[0] + [two_vertex_cut[0]]