Update app.py

app.py

@@ -27,82 +27,82 @@ class SuperSmartAgent:
         self.graph = self._build_graph()
 
     def _build_graph(self):
-    ############## NODES ###################
-    def check_reversed(state):
-        question = state["question"]
-        reversed_text = question[::-1]
-        if reversed_text.count(' ') > question.count(' '):
-            state["is_reversed"] = True
-        else:
-            state["is_reversed"] = False
-        return state
-    
-    def fix_question(state):
-        if state["is_reversed"]:
-            state["question"] = state["question"][::-1]
-        return state
-    
-    def check_python_suitability(state):
-        question = state["question"].lower()
-        patterns = ["sum", "average", "count", "sort", "generate", "regex", "convert"]
-        if any(word in question for word in patterns):
-            state["is_python"] = True
-        else:
-            state["is_python"] = False
-        return state
-    
-    def generate_code(state):
-        q = state["question"].lower()
-        if "sum" in q:
-            state["response"] = "numbers = [1, 2, 3]\nprint(sum(numbers))"
-        elif "average" in q:
-            state["response"] = "numbers = [1, 2, 3]\nprint(sum(numbers) / len(numbers))"
-        elif "sort" in q:
-            state["response"] = "data = [3, 1, 2]\ndata.sort()\nprint(data)"
-        else:
-            state["response"] = "# Code generation not implemented for this case."
-        return state
-    
-    def fallback(state):
-        state["response"] = "This question doesn't require Python or is unclear."
-        return state
-    
-        # State schema
-        state_schema = {
-            "question": str,
-            "is_reversed": bool,
-            "is_python": bool,
-            "response": str,
-        }
+        ############## NODES ###################
+        def check_reversed(state):
+            question = state["question"]
+            reversed_text = question[::-1]
+            if reversed_text.count(' ') > question.count(' '):
+                state["is_reversed"] = True
+            else:
+                state["is_reversed"] = False
+            return state
+        
+        def fix_question(state):
+            if state["is_reversed"]:
+                state["question"] = state["question"][::-1]
+            return state
+        
+        def check_python_suitability(state):
+            question = state["question"].lower()
+            patterns = ["sum", "average", "count", "sort", "generate", "regex", "convert"]
+            if any(word in question for word in patterns):
+                state["is_python"] = True
+            else:
+                state["is_python"] = False
+            return state
     
-        builder = StateGraph(state_schema)
+        def generate_code(state):
+            q = state["question"].lower()
+            if "sum" in q:
+                state["response"] = "numbers = [1, 2, 3]\nprint(sum(numbers))"
+            elif "average" in q:
+                state["response"] = "numbers = [1, 2, 3]\nprint(sum(numbers) / len(numbers))"
+            elif "sort" in q:
+                state["response"] = "data = [3, 1, 2]\ndata.sort()\nprint(data)"
+            else:
+                state["response"] = "# Code generation not implemented for this case."
+            return state
         
-        # Nodes
-        builder.add_node("check_reversed", check_reversed)
-        builder.add_node("fix_question", fix_question)
-        builder.add_node("check_python_suitability", check_python_suitability)
-        builder.add_node("generate_code", generate_code)
-        builder.add_node("fallback", fallback)
+        def fallback(state):
+            state["response"] = "This question doesn't require Python or is unclear."
+            return state
         
-        # Edges
-        builder.set_entry_point("check_reversed")
-        builder.add_edge("check_reversed", "fix_question")
-        builder.add_edge("fix_question", "check_python_suitability")
-        builder.add_conditional_edges(
-            "check_python_suitability",
-            lambda s: "generate_code" if s["is_python"] else "fallback"
-        )
-        builder.add_edge("generate_code", END)
-        builder.add_edge("fallback", END)
+            # State schema
+            state_schema = {
+                "question": str,
+                "is_reversed": bool,
+                "is_python": bool,
+                "response": str,
+            }
         
+            builder = StateGraph(state_schema)
         
-        graph = builder.compile()
-    
-        def __call__(self, question: str) -> str:
-            # use self.graph to process the question
-            state = {"question": question}
-            result = self.graph.invoke(state)
-            return result.get("response", "No answer generated.")
+            # Nodes
+            builder.add_node("check_reversed", check_reversed)
+            builder.add_node("fix_question", fix_question)
+            builder.add_node("check_python_suitability", check_python_suitability)
+            builder.add_node("generate_code", generate_code)
+            builder.add_node("fallback", fallback)
+            
+            # Edges
+            builder.set_entry_point("check_reversed")
+            builder.add_edge("check_reversed", "fix_question")
+            builder.add_edge("fix_question", "check_python_suitability")
+            builder.add_conditional_edges(
+                "check_python_suitability",
+                lambda s: "generate_code" if s["is_python"] else "fallback"
+            )
+            builder.add_edge("generate_code", END)
+            builder.add_edge("fallback", END)
+            
+            
+            graph = builder.compile()
+        
+            def __call__(self, question: str) -> str:
+                # use self.graph to process the question
+                state = {"question": question}
+                result = self.graph.invoke(state)
+                return result.get("response", "No answer generated.")
 
 
 ########################################