versionhq 1.2.1.9__tar.gz → 1.2.1.10__tar.gz

{versionhq-1.2.1.9 → versionhq-1.2.1.10}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.2
 Name: versionhq
-Version: 1.2.1.9
+Version: 1.2.1.10
 Summary: An agentic orchestration framework for building agent networks that handle task automation.
 Author-email: Kuriko Iwai <kuriko@versi0n.io>
 License: MIT License

{versionhq-1.2.1.9 → versionhq-1.2.1.10}/pyproject.toml

@@ -15,7 +15,7 @@ exclude = ["test*", "__pycache__", "*.egg-info"]
 
 [project]
 name = "versionhq"
-version = "1.2.1.9"
+version = "1.2.1.10"
 authors = [{ name = "Kuriko Iwai", email = "kuriko@versi0n.io" }]
 description = "An agentic orchestration framework for building agent networks that handle task automation."
 readme = "README.md"

{versionhq-1.2.1.9 → versionhq-1.2.1.10}/src/versionhq/__init__.py

@@ -31,7 +31,7 @@ from versionhq.task.formation import form_agent_network
 from versionhq.task_graph.draft import workflow
 
 
-__version__ = "1.2.1.9"
+__version__ = "1.2.1.10"
 __all__ = [
     "Agent",
 

{versionhq-1.2.1.9 → versionhq-1.2.1.10}/src/versionhq/task_graph/draft.py

@@ -49,11 +49,12 @@ def workflow(final_output: Type[BaseModel], context: Any = None, human: bool = T
     )
 
     task = Task(
-        description=dedent(f"Design a resource-efficient workflow to achieve the following goal: {final_output_prompt}. The workflow should consist of a list of detailed tasks that represent decision making points, each with the following information:\nname: A concise name of the task\ndescription: A concise description of the task.\nconnections: A list of target tasks that this task connects to.\ndependency_types: The type of dependency between this task and each of its connected task. Use the following dependency types: {dep_type_prompt}.\n\nPrioritize minimizing resource consumption (computation, memory, and data transfer) when defining tasks, connections, and dependencies.  Consider how data is passed between tasks and aim to reduce unnecessary data duplication or transfer. Explain any design choices made to optimize resource usage."),
+        description=dedent(f"Design a resource-efficient workflow to achieve the following goal: {final_output_prompt}. The workflow should consist of a list of detailed tasks that represent decision making points, each with the following information:\nname: A concise name of the task\ndescription: A concise description of the task.\nconnections: A list of target tasks that this task connects to.\ndependency_types: The type of dependency between this task and each of its connected task. \noutput: key output from the task.\n\nUse the following dependency types: {dep_type_prompt}.\n\nPrioritize minimizing resource consumption (computation, memory, and data transfer) when defining tasks, connections, and dependencies.  Consider how data is passed between tasks and aim to reduce unnecessary data duplication or transfer. Explain any design choices made to optimize resource usage."),
         response_fields=[
             ResponseField(title="tasks", data_type=list, items=dict, properties=[
                     ResponseField(title="name", data_type=str),
                     ResponseField(title="description", data_type=str),
+                    ResponseField(title="output", data_type=str),
                     ResponseField(title="connections", data_type=list, items=str),
                     ResponseField(title="dependency_types", data_type=list, items=str),
                 ]
@@ -66,11 +67,20 @@ def workflow(final_output: Type[BaseModel], context: Any = None, human: bool = T
         return None
 
     task_items = res.json_dict["tasks"]
-    tasks = [Task(name=item["name"], description=item["description"]) for item in task_items]
-    nodes = [Node(task=task) for task in tasks]
+    tasks, nodes = [], []
+    for item in task_items:
+        class Output(BaseModel):
+            item["output"]: str
+
+        task = Task(name=item["name"], description=item["description"], pydantic_output=Output)
+        tasks.append(task)
+        nodes.append(Node(task=task))
+
+
     task_graph = TaskGraph(
         nodes={node.identifier: node for node in nodes},
-        concl=final_output,
+        concl_format=final_output,
+        concl=None,
         should_reform=True,
     )
 

{versionhq-1.2.1.9 → versionhq-1.2.1.10}/src/versionhq/task_graph/model.py

@@ -1,12 +1,14 @@
+import matplotlib
+matplotlib.use('agg')
+
 import enum
 import uuid
 import networkx as nx
 import matplotlib.pyplot as plt
 from abc import ABC
 from typing import List, Any, Optional, Callable, Dict, Type, Tuple
-from typing_extensions import Self
 
-from pydantic import BaseModel, InstanceOf, Field, UUID4, field_validator, model_validator
+from pydantic import BaseModel, InstanceOf, Field, UUID4, field_validator
 from pydantic_core import PydanticCustomError
 
 from versionhq.task.model import Task, TaskOutput
@@ -60,7 +62,7 @@ class Node(BaseModel):
     def is_independent(self) -> bool:
         return not self.in_degree_nodes and not self.out_degree_nodes
 
-    def handle_task_execution(self, agent: Agent = None, context: str = None) -> TaskOutput | None:
+    def handle_task_execution(self, agent: Agent = None, context: str = None, format: Type[BaseModel] = None) -> TaskOutput | None:
         """
         Start task execution and update status accordingly.
         """
@@ -72,6 +74,7 @@ class Node(BaseModel):
             self.status = TaskStatus.ERROR
             return None
 
+        self.task.pydantic_output = self.task.pydantic_output if self.task.pydantic_output else format if type(format) == BaseModel else None
         res = self.task.execute(agent=agent, context=context)
         self.status = TaskStatus.COMPLETED if res else TaskStatus.ERROR
         return res
@@ -176,7 +179,7 @@ class Edge(BaseModel):
                     return False
 
 
-    def activate(self) -> TaskOutput | None:
+    def activate(self, format: Type[BaseModel] = None) -> TaskOutput | None:
         """
         Activates the edge to initiate task execution of the target node.
         """
@@ -194,7 +197,7 @@ class Edge(BaseModel):
             time.sleep(self.lag)
 
         context = self.source.task.output.raw if self.data_transfer else None
-        res = self.target.handle_task_execution(context=context)
+        res = self.target.handle_task_execution(context=context, format=format)
         return res
 
 

{versionhq-1.2.1.9 → versionhq-1.2.1.10}/src/versionhq.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.2
 Name: versionhq
-Version: 1.2.1.9
+Version: 1.2.1.10
 Summary: An agentic orchestration framework for building agent networks that handle task automation.
 Author-email: Kuriko Iwai <kuriko@versi0n.io>
 License: MIT License

{versionhq-1.2.1.9 → versionhq-1.2.1.10}/tests/task_graph/doc_test.py

@@ -1,4 +1,4 @@
-def test_create_and_activate_network(monkeypatch):
+def test_create_and_activate_network():
     import versionhq as vhq
 
     task_graph = vhq.TaskGraph(directed=False, should_reform=True)

{versionhq-1.2.1.9 → versionhq-1.2.1.10}/tests/task_graph/task_graph_test.py

@@ -20,6 +20,7 @@ def test_draft():
             context="Planning a suprise day trip for my friend to celebrate her birthday. We live in CA and we like to have Korean food.",
             human=True
         )
+
         assert task_graph
         assert [k == node.identifier and node.task and isinstance(node, vhq.Node) for k, node in task_graph.nodes.items()]
         assert [isinstance(edge.dependency_type, vhq.DependencyType) and isinstance(edge, vhq.Edge) for k, edge in task_graph.edges.items()]

{versionhq-1.2.1.9 → versionhq-1.2.1.10}/uv.lock

@@ -3980,7 +3980,7 @@ wheels = [
 
 [[package]]
 name = "versionhq"
-version = "1.2.1.9"
+version = "1.2.1.10"
 source = { editable = "." }
 dependencies = [
     { name = "appdirs" },