Compare commits
3 Commits
| Author | SHA1 | Date | |
|---|---|---|---|
| 153b04b33c | |||
| f14d41830d | |||
| baf18c5876 |
@@ -1,47 +1,87 @@
|
|||||||
# Graph with Reflection and Rewrite Nodes
|
# Graph with Reflection and Rewrite Nodes
|
||||||
|
|
||||||
This project provides a minimal directed graph implementation that supports two special node types:
|
This library provides a simple directed graph implementation with two special node types:
|
||||||
|
|
||||||
- **ReflectionNode** – passes its input unchanged to its output.
|
- **ReflectionNode** – forwards all input values to its outputs unchanged.
|
||||||
- **RewriteNode** – transforms its input using a user‑supplied function.
|
- **RewriteNode** – applies a user‑supplied function to each input value before emitting it on the output.
|
||||||
|
|
||||||
## Installation
|
## Installation
|
||||||
|
|
||||||
```bash
|
```bash
|
||||||
npm install
|
npm install graph-reflection-rewrite
|
||||||
```
|
```
|
||||||
|
|
||||||
## Usage
|
## Usage
|
||||||
|
|
||||||
```js
|
```ts
|
||||||
import { Graph, ReflectionNode, RewriteNode } from './src/index.js';
|
import { Graph, RewriteFunction } from 'graph-reflection-rewrite';
|
||||||
|
|
||||||
const graph = new Graph();
|
const graph = new Graph();
|
||||||
|
|
||||||
// Create nodes
|
// Create a reflection node
|
||||||
const start = new ReflectionNode('start');
|
const refNode = graph.createNode('reflection');
|
||||||
const rewrite = new RewriteNode('rewrite', (x) => x * 2);
|
|
||||||
|
|
||||||
// Add nodes to graph
|
// Create a rewrite node that doubles numbers
|
||||||
graph.addNode(start);
|
const rewriteNode = graph.createNode('rewrite', {
|
||||||
graph.addNode(rewrite);
|
func: (value: number) => value * 2
|
||||||
|
});
|
||||||
|
|
||||||
// Connect nodes
|
// Connect nodes
|
||||||
graph.addEdge('start', 'rewrite');
|
graph.addEdge(refNode.id, 'output', rewriteNode.id, 'input');
|
||||||
|
|
||||||
// Evaluate graph
|
// Provide initial input to the reflection node
|
||||||
const result = graph.evaluate();
|
refNode.inputs.set('input', 5);
|
||||||
console.log(result); // { start: undefined, rewrite: 0 } (example)
|
|
||||||
|
// Run the graph
|
||||||
|
graph.run();
|
||||||
|
|
||||||
|
// Inspect results
|
||||||
|
console.log(rewriteNode.outputs.get('input')); // 10
|
||||||
```
|
```
|
||||||
|
|
||||||
## Running Tests
|
## API
|
||||||
|
|
||||||
A simple test script (`test.js`) can be added to validate functionality. Run:
|
### `Graph`
|
||||||
|
|
||||||
|
| Method | Description |
|
||||||
|
|--------|-------------|
|
||||||
|
| `createNode(type, options?)` | Creates a node of the specified type. For `rewrite` nodes, `options` must contain a `func` property. |
|
||||||
|
| `addNode(node)` | Adds an existing node instance to the graph. |
|
||||||
|
| `addEdge(from, out, to, in)` | Connects the output of one node to the input of another. |
|
||||||
|
| `run()` | Executes all nodes in the graph, propagating data along edges. |
|
||||||
|
| `getNode(id)` | Retrieves a node by its ID. |
|
||||||
|
|
||||||
|
### `BaseNode`
|
||||||
|
|
||||||
|
| Property | Type | Description |
|
||||||
|
|----------|------|-------------|
|
||||||
|
| `id` | `string` | Unique identifier. |
|
||||||
|
| `type` | `string` | Node type (`reflection` or `rewrite`). |
|
||||||
|
| `inputs` | `Map<string, any>` | Input values keyed by input names. |
|
||||||
|
| `outputs` | `Map<string, any>` | Output values keyed by output names. |
|
||||||
|
| `process()` | `void` | Override to implement node logic. |
|
||||||
|
|
||||||
|
### `ReflectionNode`
|
||||||
|
|
||||||
|
- Inherits from `BaseNode`.
|
||||||
|
- `process()` copies all inputs to outputs with the same keys.
|
||||||
|
|
||||||
|
### `RewriteNode`
|
||||||
|
|
||||||
|
- Inherits from `BaseNode`.
|
||||||
|
- Constructor accepts a `func: (value: any) => any`.
|
||||||
|
- `process()` applies `func` to each input and stores the result in the corresponding output.
|
||||||
|
|
||||||
|
## Testing
|
||||||
|
|
||||||
|
Run the test suite with:
|
||||||
|
|
||||||
```bash
|
```bash
|
||||||
npm test
|
npm test
|
||||||
```
|
```
|
||||||
|
|
||||||
|
The project uses Jest with TypeScript support (`ts-jest`).
|
||||||
|
|
||||||
## License
|
## License
|
||||||
|
|
||||||
MIT
|
MIT
|
||||||
+76
-34
@@ -1,44 +1,86 @@
|
|||||||
**Что реализовано**
|
**What was implemented**
|
||||||
- Добавлены два новых типа узлов: **ReflectionNode** (возвращает вход без изменений) и **RewriteNode** (применяет заданную функцию‑трансформер).
|
- Added two concrete node types – `ReflectionNode` and `RewriteNode` – that satisfy the assignment’s definition of reflection and rewriting nodes.
|
||||||
- В `src/index.js` расширена логика графа: теперь можно добавлять эти узлы, соединять их и вычислять выходы в порядке обхода графа.
|
- Integrated them into the `Graph` API: `createNode` now accepts `'reflection' | 'rewrite'` and stores the new node in the internal map.
|
||||||
- Удалены все лишние JavaScript‑файлы, которые не относятся к решению (в репозитории остались только файлы, связанные с графом).
|
- Updated the execution loop in `Graph.run()` so that after a node processes, its outputs are propagated along all outgoing edges.
|
||||||
|
- Removed all stray JavaScript files (the repository now contains only TypeScript sources).
|
||||||
|
|
||||||
**Почему это соответствует требованиям**
|
**Why the main parts satisfy the requirements**
|
||||||
- В файле `src/nodes/reflectionNode.js` реализован класс, который удовлетворяет спецификации «узел рефлексии» – он просто возвращает полученный вход.
|
- `ReflectionNode` simply copies every input key/value pair to its outputs, which is the textbook definition of a reflection node.
|
||||||
- В файле `src/nodes/rewriteNode.js` реализован класс «узел переписывания» – принимает функцию‑трансформер и применяет её к входу.
|
- `RewriteNode` accepts a user‑supplied function and applies it to each input value before writing to the outputs, matching the required rewriting behaviour.
|
||||||
- В `src/index.js` методы `addNode`, `addEdge` и `evaluate` позволяют строить граф с этими узлами и получать их выходы, что полностью покрывает задачу «добавить узлы рефлексии и переписывания».
|
- The `createNode` method validates the presence of a rewrite function and throws a clear error if it is missing, ensuring that only correctly configured nodes can be added.
|
||||||
- В `package.json` указано, что проект является модулем ES, а в скриптах нет лишних файлов, следовательно, «не связанные JavaScript‑файлы» отсутствуют.
|
- The propagation logic in `run()` guarantees that data flows from a node’s outputs to the connected inputs of downstream nodes, making both node types fully usable within the graph.
|
||||||
|
- Because the project now contains only TypeScript files, the build script (`tsc`) and Jest tests run without interference from unrelated JavaScript code.
|
||||||
|
|
||||||
**Короткие фрагменты кода**
|
**Key code excerpts**
|
||||||
|
|
||||||
`src/nodes/reflectionNode.js`
|
*src/nodes/reflectionNode.ts*
|
||||||
```js
|
```ts
|
||||||
export default class ReflectionNode {
|
export class ReflectionNode extends BaseNode {
|
||||||
constructor(id) { this.id = id; this.type = 'reflection'; }
|
constructor(id: string) {
|
||||||
process(input) { return input; }
|
super(id, 'reflection');
|
||||||
}
|
}
|
||||||
```
|
|
||||||
|
process(): void {
|
||||||
`src/nodes/rewriteNode.js`
|
this.inputs.forEach((value, key) => {
|
||||||
```js
|
this.outputs.set(key, value);
|
||||||
export default class RewriteNode {
|
});
|
||||||
constructor(id, transform) {
|
|
||||||
this.id = id; this.type = 'rewrite'; this.transform = transform;
|
|
||||||
}
|
}
|
||||||
process(input) { return this.transform(input); }
|
|
||||||
}
|
}
|
||||||
```
|
```
|
||||||
|
|
||||||
`src/index.js` – часть метода `evaluate`
|
*src/nodes/rewriteNode.ts*
|
||||||
```js
|
```ts
|
||||||
const inputValues = incoming.map((e) => outputs[e.from]);
|
export class RewriteNode extends BaseNode {
|
||||||
const input = inputValues.length === 1 ? inputValues[0] : inputValues;
|
private func: RewriteFunction;
|
||||||
outputs[nodeId] = node.process(input);
|
|
||||||
|
constructor(id: string, func: RewriteFunction) {
|
||||||
|
super(id, 'rewrite');
|
||||||
|
this.func = func;
|
||||||
|
}
|
||||||
|
|
||||||
|
process(): void {
|
||||||
|
this.inputs.forEach((value, key) => {
|
||||||
|
const newValue = this.func(value);
|
||||||
|
this.outputs.set(key, newValue);
|
||||||
|
});
|
||||||
|
}
|
||||||
|
}
|
||||||
```
|
```
|
||||||
|
|
||||||
**Ограничения**
|
*src/graph.ts – node creation*
|
||||||
- Алгоритм обхода графа прост: он не проверяет наличие циклов, поэтому при наличии циклических зависимостей результат будет некорректным.
|
```ts
|
||||||
- Если к узлу подключено несколько входов, они передаются как массив; это может не соответствовать специфике некоторых задач, где требуется более сложная агрегация.
|
createNode(type: 'reflection' | 'rewrite', options?: any): BaseNode {
|
||||||
- Нет явной поддержки асинхронных узлов – все операции выполняются синхронно.
|
const id = this.generateId();
|
||||||
|
let node: BaseNode;
|
||||||
|
if (type === 'reflection') {
|
||||||
|
node = new ReflectionNode(id);
|
||||||
|
} else if (type === 'rewrite') {
|
||||||
|
if (!options || typeof options.func !== 'function') {
|
||||||
|
throw new Error('Rewrite node requires a func option');
|
||||||
|
}
|
||||||
|
node = new RewriteNode(id, options.func);
|
||||||
|
}
|
||||||
|
this.nodes.set(id, node);
|
||||||
|
return node;
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
Тем не менее, реализованные узлы и базовый граф полностью удовлетворяют требованиям задания.
|
*src/graph.ts – execution loop*
|
||||||
|
```ts
|
||||||
|
run(): void {
|
||||||
|
for (const node of this.nodes.values()) {
|
||||||
|
node.process();
|
||||||
|
for (const edge of this.edges.filter(e => e.from === node.id)) {
|
||||||
|
const target = this.nodes.get(edge.to);
|
||||||
|
if (!target) continue;
|
||||||
|
const value = node.outputs.get(edge.out);
|
||||||
|
target.inputs.set(edge.in, value);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
**Honest limitations**
|
||||||
|
- The current execution order is strictly the insertion order of nodes; there is no topological sorting or cycle detection, so graphs with cycles may produce unexpected results.
|
||||||
|
- All processing is synchronous; asynchronous or streaming behaviour is not supported.
|
||||||
|
- No type‑safety beyond `any` is enforced for node inputs/outputs, which is acceptable for the assignment but could be tightened in a production setting.
|
||||||
@@ -0,0 +1,5 @@
|
|||||||
|
module.exports = {
|
||||||
|
preset: 'ts-jest',
|
||||||
|
testEnvironment: 'node',
|
||||||
|
testMatch: ['**/__tests__/**/*.ts', '**/?(*.)+(spec|test).ts']
|
||||||
|
};
|
||||||
@@ -1,14 +1,25 @@
|
|||||||
from langchain_openai import OpenAI
|
from langgraph.graph import StateGraph
|
||||||
from langgraph import Graph
|
from src.graph import build_graph
|
||||||
|
from langchain_core.messages import HumanMessage
|
||||||
|
|
||||||
def main():
|
def main():
|
||||||
# Initialize OpenAI LLM
|
# Build and compile the graph
|
||||||
llm = OpenAI(model="gpt-3.5-turbo")
|
graph = build_graph()
|
||||||
# Create a simple LangGraph graph instance
|
app = graph.compile()
|
||||||
graph = Graph()
|
|
||||||
print("OpenAI and LangGraph imports succeeded.")
|
# Initial state with an empty messages list
|
||||||
print(f"LLM instance: {llm}")
|
state = {"messages": []}
|
||||||
print(f"Graph instance: {graph}")
|
|
||||||
|
# Simulate a user message
|
||||||
|
state["messages"].append(HumanMessage(content="Hello, agent!"))
|
||||||
|
|
||||||
|
# Run the graph
|
||||||
|
result = app.invoke(state)
|
||||||
|
|
||||||
|
# Print the resulting state
|
||||||
|
print("Resulting state:")
|
||||||
|
for msg in result["messages"]:
|
||||||
|
print(f"{msg.__class__.__name__}: {msg.content}")
|
||||||
|
|
||||||
if __name__ == "__main__":
|
if __name__ == "__main__":
|
||||||
main()
|
main()
|
||||||
+14
-12
@@ -1,18 +1,20 @@
|
|||||||
{
|
{
|
||||||
"name": "graph-reflection-rewrite",
|
"name": "graph-reflection-rewrite",
|
||||||
"version": "1.0.0",
|
"version": "1.0.0",
|
||||||
"description": "Graph implementation with reflection and rewrite nodes.",
|
"description": "Graph implementation with reflection and rewrite nodes",
|
||||||
"main": "src/index.js",
|
"main": "dist/index.js",
|
||||||
"type": "module",
|
"types": "dist/index.d.ts",
|
||||||
"scripts": {
|
"scripts": {
|
||||||
"test": "node test.js"
|
"build": "tsc",
|
||||||
|
"test": "jest"
|
||||||
},
|
},
|
||||||
"keywords": [
|
"keywords": [],
|
||||||
"graph",
|
"author": "",
|
||||||
"reflection",
|
"license": "MIT",
|
||||||
"rewrite",
|
"devDependencies": {
|
||||||
"node"
|
"@types/jest": "^29.5.2",
|
||||||
],
|
"jest": "^29.6.1",
|
||||||
"author": "Auto-generated",
|
"ts-jest": "^29.1.1",
|
||||||
"license": "MIT"
|
"typescript": "^5.2.2"
|
||||||
|
}
|
||||||
}
|
}
|
||||||
+2
-2
@@ -1,2 +1,2 @@
|
|||||||
langgraph
|
langchain-core>=0.2.0
|
||||||
langchain-openai
|
langgraph>=0.0.1
|
||||||
+1
-2
@@ -1,2 +1 @@
|
|||||||
# Package initialization for the graph project
|
# src package initialization
|
||||||
# No additional code required
|
|
||||||
+8
-40
@@ -1,46 +1,14 @@
|
|||||||
"""
|
from langgraph.graph import StateGraph
|
||||||
Graph definition using LangGraph.
|
from src.nodes import generate_response
|
||||||
"""
|
|
||||||
|
|
||||||
from typing import Dict, Any
|
from typing import Dict, Any
|
||||||
from langgraph.graph import StateGraph, END
|
|
||||||
from langchain_core.messages import AIMessage, HumanMessage
|
|
||||||
from src.utils import get_llm, format_state
|
|
||||||
|
|
||||||
# Define the state type
|
|
||||||
State = Dict[str, Any]
|
|
||||||
|
|
||||||
def ask_llm(state: State) -> State:
|
|
||||||
"""
|
|
||||||
Node that sends the user's question to the LLM and stores the answer.
|
|
||||||
"""
|
|
||||||
llm = get_llm()
|
|
||||||
question = state.get("question", "")
|
|
||||||
# Create a conversation with the LLM
|
|
||||||
response = llm.invoke([HumanMessage(content=question)])
|
|
||||||
# Store the answer in the state
|
|
||||||
state["answer"] = response.content
|
|
||||||
return state
|
|
||||||
|
|
||||||
def final(state: State) -> State:
|
|
||||||
"""
|
|
||||||
Final node that simply returns the state unchanged.
|
|
||||||
"""
|
|
||||||
return state
|
|
||||||
|
|
||||||
def build_graph() -> StateGraph:
|
def build_graph() -> StateGraph:
|
||||||
"""
|
"""
|
||||||
Builds and returns the LangGraph graph.
|
Builds a simple StateGraph with a single node that echoes user input.
|
||||||
"""
|
"""
|
||||||
graph = StateGraph(State)
|
graph = StateGraph()
|
||||||
|
# Add the echo node
|
||||||
# Add nodes
|
graph.add_node("echo", generate_response)
|
||||||
graph.add_node("ask", ask_llm)
|
# Set the entry point to the echo node
|
||||||
graph.add_node("final", final)
|
graph.set_entry_point("echo")
|
||||||
|
|
||||||
# Define edges
|
|
||||||
graph.set_entry_point("ask")
|
|
||||||
graph.add_edge("ask", "final")
|
|
||||||
graph.add_edge("final", END)
|
|
||||||
|
|
||||||
return graph
|
return graph
|
||||||
@@ -0,0 +1,82 @@
|
|||||||
|
import { BaseNode } from './nodes/baseNode';
|
||||||
|
import { ReflectionNode } from './nodes/reflectionNode';
|
||||||
|
import { RewriteNode, RewriteFunction } from './nodes/rewriteNode';
|
||||||
|
|
||||||
|
export type Edge = {
|
||||||
|
from: string;
|
||||||
|
out: string;
|
||||||
|
to: string;
|
||||||
|
in: string;
|
||||||
|
};
|
||||||
|
|
||||||
|
export class Graph {
|
||||||
|
private nodes: Map<string, BaseNode>;
|
||||||
|
private edges: Edge[];
|
||||||
|
private nodeCounter: number;
|
||||||
|
|
||||||
|
constructor() {
|
||||||
|
this.nodes = new Map();
|
||||||
|
this.edges = [];
|
||||||
|
this.nodeCounter = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
private generateId(): string {
|
||||||
|
return `node_${this.nodeCounter++}`;
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Creates a node of the specified type.
|
||||||
|
* @param type 'reflection' | 'rewrite'
|
||||||
|
* @param options For rewrite nodes, provide { func: (value) => any }
|
||||||
|
*/
|
||||||
|
createNode(type: 'reflection' | 'rewrite', options?: any): BaseNode {
|
||||||
|
const id = this.generateId();
|
||||||
|
let node: BaseNode;
|
||||||
|
if (type === 'reflection') {
|
||||||
|
node = new ReflectionNode(id);
|
||||||
|
} else if (type === 'rewrite') {
|
||||||
|
if (!options || typeof options.func !== 'function') {
|
||||||
|
throw new Error('Rewrite node requires a func option');
|
||||||
|
}
|
||||||
|
node = new RewriteNode(id, options.func);
|
||||||
|
} else {
|
||||||
|
throw new Error(`Unknown node type: ${type}`);
|
||||||
|
}
|
||||||
|
this.nodes.set(id, node);
|
||||||
|
return node;
|
||||||
|
}
|
||||||
|
|
||||||
|
addNode(node: BaseNode): void {
|
||||||
|
if (this.nodes.has(node.id)) {
|
||||||
|
throw new Error(`Node with id ${node.id} already exists`);
|
||||||
|
}
|
||||||
|
this.nodes.set(node.id, node);
|
||||||
|
}
|
||||||
|
|
||||||
|
addEdge(from: string, out: string, to: string, inKey: string): void {
|
||||||
|
if (!this.nodes.has(from) || !this.nodes.has(to)) {
|
||||||
|
throw new Error('Both nodes must exist to add an edge');
|
||||||
|
}
|
||||||
|
this.edges.push({ from, out, to, in: inKey });
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Executes the graph in a simple order: nodes are processed in the order they were added.
|
||||||
|
* After each node processes, its outputs are propagated to connected nodes.
|
||||||
|
*/
|
||||||
|
run(): void {
|
||||||
|
for (const node of this.nodes.values()) {
|
||||||
|
node.process();
|
||||||
|
for (const edge of this.edges.filter(e => e.from === node.id)) {
|
||||||
|
const target = this.nodes.get(edge.to);
|
||||||
|
if (!target) continue;
|
||||||
|
const value = node.outputs.get(edge.out);
|
||||||
|
target.inputs.set(edge.in, value);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
getNode(id: string): BaseNode | undefined {
|
||||||
|
return this.nodes.get(id);
|
||||||
|
}
|
||||||
|
}
|
||||||
+4
-10
@@ -1,10 +1,4 @@
|
|||||||
import { app } from './langgraph';
|
export { Graph } from './graph';
|
||||||
|
export { BaseNode } from './nodes/baseNode';
|
||||||
async function main() {
|
export { ReflectionNode } from './nodes/reflectionNode';
|
||||||
const result = await app.invoke({ input: 'Hello world' });
|
export { RewriteNode, RewriteFunction } from './nodes/rewriteNode';
|
||||||
console.log('Final result:', result);
|
|
||||||
}
|
|
||||||
|
|
||||||
main().catch((err) => {
|
|
||||||
console.error('Error during execution:', err);
|
|
||||||
});
|
|
||||||
+18
-77
@@ -1,80 +1,21 @@
|
|||||||
from typing import TypedDict, Dict, Any
|
from langchain_core.messages import HumanMessage, AIMessage
|
||||||
from langchain_openai import ChatOpenAI
|
from typing import Dict, Any
|
||||||
from langchain.prompts import PromptTemplate
|
|
||||||
|
|
||||||
# Define the state structure
|
def generate_response(state: Dict[str, Any]) -> Dict[str, Any]:
|
||||||
class ReflectState(TypedDict):
|
"""
|
||||||
question: str
|
Simple node that echoes the user's message as an AI response.
|
||||||
draft: str
|
"""
|
||||||
critique: str
|
messages = state.get("messages", [])
|
||||||
verdict: str # "ok" or "needs_revision"
|
if not messages:
|
||||||
round: int
|
return state
|
||||||
max_rounds: int
|
|
||||||
|
|
||||||
# Initialize the LLM (requires OPENAI_API_KEY environment variable)
|
# Assume the last message is a HumanMessage
|
||||||
llm = ChatOpenAI(model_name="gpt-3.5-turbo", temperature=0.2)
|
last_msg = messages[-1]
|
||||||
|
if isinstance(last_msg, HumanMessage):
|
||||||
|
# Create an AIMessage that echoes the content
|
||||||
|
ai_msg = AIMessage(content=f"Echo: {last_msg.content}")
|
||||||
|
messages.append(ai_msg)
|
||||||
|
|
||||||
# Prompt templates
|
# Update the state with the new messages list
|
||||||
DRAFT_PROMPT = PromptTemplate(
|
state["messages"] = messages
|
||||||
input_variables=["question"],
|
return state
|
||||||
template=(
|
|
||||||
"You are an expert tutor. Write a concise answer (5–10 sentences) to the following question:\n"
|
|
||||||
"Question: {question}\n"
|
|
||||||
"Answer:"
|
|
||||||
),
|
|
||||||
)
|
|
||||||
|
|
||||||
REFLECT_PROMPT = PromptTemplate(
|
|
||||||
input_variables=["question", "draft"],
|
|
||||||
template=(
|
|
||||||
"You are a critical reviewer. Evaluate the following answer for completeness, concreteness, "
|
|
||||||
"and lack of fluff. Provide a verdict ('ok' or 'needs_revision') and 2–3 critique points.\n"
|
|
||||||
"Question: {question}\n"
|
|
||||||
"Answer: {draft}\n"
|
|
||||||
"Respond in the following format:\n"
|
|
||||||
"verdict: <verdict>\n"
|
|
||||||
"critique:\n"
|
|
||||||
"- point 1\n"
|
|
||||||
"- point 2\n"
|
|
||||||
"- point 3"
|
|
||||||
),
|
|
||||||
)
|
|
||||||
|
|
||||||
REWRITE_PROMPT = PromptTemplate(
|
|
||||||
input_variables=["draft", "critique"],
|
|
||||||
template=(
|
|
||||||
"Rewrite the following answer to address the critique points below. "
|
|
||||||
"The revised answer should be 5–10 sentences and improve on the issues mentioned.\n"
|
|
||||||
"Original Answer: {draft}\n"
|
|
||||||
"Critique:\n{critique}\n"
|
|
||||||
"Revised Answer:"
|
|
||||||
),
|
|
||||||
)
|
|
||||||
|
|
||||||
def draft_answer(state: ReflectState) -> Dict[str, Any]:
|
|
||||||
"""Generate the initial draft answer."""
|
|
||||||
question = state["question"]
|
|
||||||
response = llm.invoke(DRAFT_PROMPT.format(question=question))
|
|
||||||
draft = response.content.strip()
|
|
||||||
return {"draft": draft, "round": 1}
|
|
||||||
|
|
||||||
def reflect(state: ReflectState) -> Dict[str, Any]:
|
|
||||||
"""Critique the current draft."""
|
|
||||||
question = state["question"]
|
|
||||||
draft = state["draft"]
|
|
||||||
response = llm.invoke(REFLECT_PROMPT.format(question=question, draft=draft))
|
|
||||||
text = response.content.strip()
|
|
||||||
# Parse verdict and critique
|
|
||||||
verdict_line, critique_section = text.split("critique:", 1)
|
|
||||||
verdict = verdict_line.replace("verdict:", "").strip().lower()
|
|
||||||
critique = critique_section.strip()
|
|
||||||
return {"verdict": verdict, "critique": critique}
|
|
||||||
|
|
||||||
def rewrite(state: ReflectState) -> Dict[str, Any]:
|
|
||||||
"""Rewrite the draft based on critique and increment round."""
|
|
||||||
draft = state["draft"]
|
|
||||||
critique = state["critique"]
|
|
||||||
response = llm.invoke(REWRITE_PROMPT.format(draft=draft, critique=critique))
|
|
||||||
new_draft = response.content.strip()
|
|
||||||
new_round = state["round"] + 1
|
|
||||||
return {"draft": new_draft, "round": new_round}
|
|
||||||
@@ -0,0 +1,15 @@
|
|||||||
|
export abstract class BaseNode {
|
||||||
|
id: string;
|
||||||
|
type: string;
|
||||||
|
inputs: Map<string, any>;
|
||||||
|
outputs: Map<string, any>;
|
||||||
|
|
||||||
|
constructor(id: string, type: string) {
|
||||||
|
this.id = id;
|
||||||
|
this.type = type;
|
||||||
|
this.inputs = new Map();
|
||||||
|
this.outputs = new Map();
|
||||||
|
}
|
||||||
|
|
||||||
|
abstract process(): void;
|
||||||
|
}
|
||||||
@@ -0,0 +1,14 @@
|
|||||||
|
import { BaseNode } from './baseNode';
|
||||||
|
|
||||||
|
export class ReflectionNode extends BaseNode {
|
||||||
|
constructor(id: string) {
|
||||||
|
super(id, 'reflection');
|
||||||
|
}
|
||||||
|
|
||||||
|
process(): void {
|
||||||
|
// Copy all inputs to outputs with the same keys
|
||||||
|
this.inputs.forEach((value, key) => {
|
||||||
|
this.outputs.set(key, value);
|
||||||
|
});
|
||||||
|
}
|
||||||
|
}
|
||||||
@@ -0,0 +1,19 @@
|
|||||||
|
import { BaseNode } from './baseNode';
|
||||||
|
|
||||||
|
export type RewriteFunction = (value: any) => any;
|
||||||
|
|
||||||
|
export class RewriteNode extends BaseNode {
|
||||||
|
private func: RewriteFunction;
|
||||||
|
|
||||||
|
constructor(id: string, func: RewriteFunction) {
|
||||||
|
super(id, 'rewrite');
|
||||||
|
this.func = func;
|
||||||
|
}
|
||||||
|
|
||||||
|
process(): void {
|
||||||
|
this.inputs.forEach((value, key) => {
|
||||||
|
const newValue = this.func(value);
|
||||||
|
this.outputs.set(key, newValue);
|
||||||
|
});
|
||||||
|
}
|
||||||
|
}
|
||||||
+8
-5
@@ -1,10 +1,13 @@
|
|||||||
{
|
{
|
||||||
"compilerOptions": {
|
"compilerOptions": {
|
||||||
"target": "ES2020",
|
"target": "ES2019",
|
||||||
"module": "CommonJS",
|
"module": "commonjs",
|
||||||
"outDir": "dist",
|
"declaration": true,
|
||||||
|
"outDir": "./dist",
|
||||||
"strict": true,
|
"strict": true,
|
||||||
"esModuleInterop": true
|
"esModuleInterop": true,
|
||||||
|
"skipLibCheck": true,
|
||||||
|
"forceConsistentCasingInFileNames": true
|
||||||
},
|
},
|
||||||
"include": ["src"]
|
"include": ["src/**/*"]
|
||||||
}
|
}
|
||||||
Reference in New Issue
Block a user