Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

feat: Graphs #210

Open
1 task done
rlindskog opened this issue Jan 16, 2025 · 0 comments
Open
1 task done

feat: Graphs #210

rlindskog opened this issue Jan 16, 2025 · 0 comments

Comments

@rlindskog
Copy link

  • I have looked for existing issues (including closed) about this

Feature Request

Motivation

  • The pipelines feature is nice for linear agents.
  • The conditional! PR is ideal for branching
  • Graphs could add even more flexibility (loops, self references, etc)

Proposal

  • It might be possible to implement computation graphs without needing to implement anything on the heap (like a HashMap) just by using structs. This way it can be fully type safe.

Alternatives

@rlindskog rlindskog changed the title feat: <title> feat: Graphs Jan 16, 2025
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant