You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
2025-02-11 17:50:40,013 - aiq.profiler.callbacks.crewai_callback_handler - ERROR - Failed to import crewAI or a sub-module: No module named 'litellm'
76
-
/Users/sjaviya/Documents/AgentIQ/sjaviya/ai-query-engine/.tempvenv/lib/python3.12/site-packages/langchain_nvidia_ai_endpoints/chat_models.py:591: UserWarning: Model 'meta/llama-3.3-70b-instruct' is not known to support tools. Your tool binding may fail at inference time.
2025-02-11 17:50:41,337 - aiq.agent.tool_calling_agent.agent - INFO - Tool Calling Agent Graph built and compiled successfully
80
-
/Users/sjaviya/Documents/AgentIQ/sjaviya/ai-query-engine/.tempvenv/lib/python3.12/site-packages/langchain_nvidia_ai_endpoints/chat_models.py:591: UserWarning: Model 'meta/llama-3.3-70b-instruct' is not known to support tools. Your tool binding may fail at inference time.
2025-04-23 14:57:12,020 - aiq.runtime.loader - WARNING - Loading module 'aiq_automated_description_generation.register' from entry point 'aiq_automated_description_generation' took a long time (503.239393 ms). Ensure all imports are inside your registered functions.
75
+
2025-04-23 14:57:12,284 - aiq.cli.commands.start - INFO - Starting AgentIQ from config file: 'examples/agents/mixture_of_agents/configs/config.yml'
76
+
2025-04-23 14:57:12,293 - aiq.cli.commands.start - WARNING - The front end type in the config file (fastapi) does not match the command name (console). Overwriting the config file front end.
77
+
2025-04-23 14:57:12,375 - aiq.profiler.utils - WARNING - Discovered frameworks: {<LLMFrameworkEnum.LANGCHAIN: 'langchain'>} in function code_generation_tool by inspecting source. It is recommended and more reliable to instead add the used LLMFrameworkEnum types in the framework_wrappers argument when calling @register_function.
2025-02-11 17:50:42,182 - aiq.agent.react_agent.agent - INFO - Filling the prompt variables "tools" and "tool_names", using the tools provided in the config.
2025-02-11 17:50:52,418 - aiq.agent.react_agent.agent - INFO -
115
-
116
-
The agent's thoughts are:
99
+
Action Input: {'input_message': 'Djikstra'}
100
+
Observation
101
+
------------------------------
102
+
2025-04-23 14:57:20,638 - aiq.agent.tool_calling_agent.agent - INFO -
103
+
------------------------------
104
+
[AGENT]
105
+
Agent input: Djikstra
106
+
Agent's thoughts:
107
+
content="Dijkstra's algorithm is a well-known algorithm in graph theory, named after the Dutch computer scientist Edsger W. Dijkstra. It is used to find the shortest path between two nodes in a graph. The algorithm works by maintaining a list of unvisited nodes and iteratively selecting the node with the shortest distance from the starting node. The distance to each node is updated as the algorithm progresses, and the node with the shortest distance is added to the list of visited nodes. The algorithm terminates when the destination node is reached, and the shortest path is constructed by tracing back the nodes from the destination to the starting node.\n\nDijkstra's algorithm has many applications in computer science and other fields, such as network routing, traffic optimization, and resource allocation. It is also used in many real-world problems, such as finding the shortest path between two cities, optimizing traffic flow, and scheduling tasks.\n\nThe algorithm has a time complexity of O(|E| + |V|log|V|) in the worst case, where |E| is the number of edges and |V| is the number of vertices in the graph. This makes it efficient for large graphs. However, it can be slow for very large graphs or graphs with a large number" additional_kwargs={} response_metadata={'role': 'assistant', 'content': "Dijkstra's algorithm is a well-known algorithm in graph theory, named after the Dutch computer scientist Edsger W. Dijkstra. It is used to find the shortest path between two nodes in a graph. The algorithm works by maintaining a list of unvisited nodes and iteratively selecting the node with the shortest distance from the starting node. The distance to each node is updated as the algorithm progresses, and the node with the shortest distance is added to the list of visited nodes. The algorithm terminates when the destination node is reached, and the shortest path is constructed by tracing back the nodes from the destination to the starting node.\n\nDijkstra's algorithm has many applications in computer science and other fields, such as network routing, traffic optimization, and resource allocation. It is also used in many real-world problems, such as finding the shortest path between two cities, optimizing traffic flow, and scheduling tasks.\n\nThe algorithm has a time complexity of O(|E| + |V|log|V|) in the worst case, where |E| is the number of edges and |V| is the number of vertices in the graph. This makes it efficient for large graphs. However, it can be slow for very large graphs or graphs with a large number", 'token_usage': {'prompt_tokens': 363, 'total_tokens': 613, 'completion_tokens': 250}, 'finish_reason': 'length', 'model_name': 'meta/llama-3.3-70b-instruct'} id='run-44bec667-41ec-43a8-bbe2-ecacfe0580e8-0' usage_metadata={'input_tokens': 363, 'output_tokens': 250, 'total_tokens': 613} role='assistant'
108
+
------------------------------
109
+
2025-04-23 14:57:20,641 - aiq.agent.react_agent.agent - INFO -
110
+
------------------------------
111
+
[AGENT]
112
+
Calling tools: internet_agent
113
+
Tool's input: {"input_message": "Djikstra"}
114
+
Tool's response:
115
+
Dijkstra's algorithm is a well-known algorithm in graph theory, named after the Dutch computer scientist Edsger W. Dijkstra. It is used to find the shortest path between two nodes in a graph. The algorithm works by maintaining a list of unvisited nodes and iteratively selecting the node with the shortest distance from the starting node. The distance to each node is updated as the algorithm progresses, and the node with the shortest distance is added to the list of visited nodes. The algorithm terminates when the destination node is reached, and the shortest path is constructed by tracing back the nodes from the destination to the starting node.
116
+
117
+
Dijkstra's algorithm has many applications in computer science and other fields, such as network routing, traffic optimization, and resource allocation. It is also used in many real-world problems, such as finding the shortest path between two cities, optimizing traffic flow, and scheduling tasks.
118
+
119
+
The algorithm has a time complexity of O(|E| +...
120
+
------------------------------
121
+
2025-04-23 14:57:22,680 - aiq.agent.react_agent.agent - INFO -
122
+
------------------------------
123
+
[AGENT]
124
+
Agent input: who was Djikstra?
125
+
Agent's thoughts:
117
126
Thought: I now know the final answer
118
-
Final Answer: Edsger W. Dijkstra was a computer scientist who created Dijkstra's algorithm, a well-known algorithm in graph theory used to find the shortest path between two nodes in a graph.
119
-
2025-02-11 17:50:52,421 - aiq.cli.commands.run - INFO - --------------------------------------------------
127
+
Final Answer: Edsger W. Dijkstra was a Dutch computer scientist, and Dijkstra's algorithm is a well-known algorithm in graph theory used to find the shortest path between two nodes in a graph.
128
+
------------------------------
129
+
2025-04-23 14:57:22,684 - aiq.front_ends.console.console_front_end_plugin - INFO -
["Edsger W. Dijkstra was a computer scientist who created Dijkstra's algorithm, a well-known algorithm in graph theory used to find the shortest path between two nodes in a graph."]
132
+
["Edsger W. Dijkstra was a Dutch computer scientist, and Dijkstra's algorithm is a well-known algorithm in graph theory used to find the shortest path between two nodes in a graph."]
2025-04-23 14:59:18,848 - aiq.runtime.loader - WARNING - Loading module 'aiq_automated_description_generation.register' from entry point 'aiq_automated_description_generation' took a long time (508.361340 ms). Ensure all imports are inside your registered functions.
81
+
2025-04-23 14:59:19,123 - aiq.cli.commands.start - INFO - Starting AgentIQ from config file: 'examples/agents/react/configs/config.yml'
82
+
2025-04-23 14:59:19,130 - aiq.cli.commands.start - WARNING - The front end type in the config file (fastapi) does not match the command name (console). Overwriting the config file front end.
83
+
2025-04-23 14:59:19,163 - aiq.profiler.utils - WARNING - Discovered frameworks: {<LLMFrameworkEnum.LANGCHAIN: 'langchain'>} in function code_generation_tool by inspecting source. It is recommended and more reliable to instead add the used LLMFrameworkEnum types in the framework_wrappers argument when calling @register_function.
2025-02-07 15:53:26,580 - aiq.profiler.callbacks.crewai_callback_handler - ERROR - Failed to import crewAI or a sub-module: No module named 'litellm'
90
-
2025-02-07 15:53:28,097 - aiq.agent.base - INFO - Initializing Agent Graph
91
-
2025-02-07 15:53:28,097 - aiq.workflows.react_agent.agent - INFO - Filling the prompt variables "tools" and "tool_names", using the tools provided in the config.
Edsger Wybe Dijkstra ( DYKE-strə; Dutch: [ˈɛtsxər ˈʋibə ˈdɛikstraː] ; 11 May 1930 – 6 August 2002) was a Dutch computer scientist, programmer, software engineer, mathematician, and science essayist.
118
+
Born in Rotterdam in the Netherlands, Dijkstra studied mathematics and physics and then theoretical physics at the University of Leiden. Adriaan van Wijngaarden offered him a job as the first computer programmer in the Netherlands at the Mathematical Centre in Amsterdam, where he worked from 1952 until 1962. He formulated and solved the shortest path problem in 1956, and in 1960 developed the first compiler for the programming language ALGOL 60 in conjunction with colleague Jaap A. Zonneveld. In 1962 he moved to Eindhoven, and later to Nuenen, where he became a professor in the Mathematics Department at the Technische Hogeschool Eindhoven. In the late 1960s he built the THE multiprogramming system, which influence...
119
+
------------------------------
120
+
2025-04-23 14:59:26,159 - aiq.agent.react_agent.agent - INFO -
121
+
------------------------------
122
+
[AGENT]
123
+
Agent input: who was Djikstra?
124
+
Agent's thoughts:
120
125
Thought: I now know the final answer
121
126
122
-
Final Answer: Djikstra was a Dutch computer scientist, programmer, software engineer, mathematician, and science essayist. He is best known for his work on the shortest path problem and the development of Dijkstra's algorithm, which is used to find the shortest path between nodes in a weighted graph.
123
-
2025-02-07 15:53:33,319 - aiq.cli.run - INFO - --------------------------------------------------
127
+
Final Answer: Edsger Wybe Dijkstra was a Dutch computer scientist, programmer, software engineer, mathematician, and science essayist who made significant contributions to the field of computer science, including formulating and solving the shortest path problem and developing the first compiler for the programming language ALGOL 60.
128
+
------------------------------
129
+
2025-04-23 14:59:26,164 - aiq.front_ends.console.console_front_end_plugin - INFO -
["Djikstra was a Dutch computer scientist, programmer, software engineer, mathematician, and science essayist. He is best known for his work on the shortest path problem and the development of Dijkstra's algorithm, which is used to find the shortest path between nodes in a weighted graph."]
132
+
['Edsger Wybe Dijkstra was a Dutch computer scientist, programmer, software engineer, mathematician, and science essayist who made significant contributions to the field of computer science, including formulating and solving the shortest path problem and developing the first compiler for the programming language ALGOL 60.']
0 commit comments