Home Projects graph-of-thoughts
graph-of-thoughts
Python

graph-of-thoughts

Official Implementation of "Graph of Thoughts: Solving Elaborate Problems with Large Language Models"

by spcl · GitHub
Stars
Forks
Trending
Created
Last commit
Language
graph-of-thoughtsgraph-structuresgraphsPython
View on GitHub
In plain words

Solve complex problems by organizing them as a graph that a language model can process.

You maintain this project?

Claim its page: indexed whatever its rank, translated into six languages, and enriched with what you write yourself.

Claim this page →
graph-of-thoughts — GitHub preview card
📈 Star history
2.83k2.81k
2026-07-072026-08-31
📈 Track graph-of-thoughts

Get an email alert on its next release or when it starts trending — never miss the moment.

Free · no card · unsubscribe anytime
Get email alerts →
📄 About

Official Implementation of "Graph of Thoughts: Solving Elaborate Problems with Large Language Models"

graph-of-thoughts has 2.8k stars on GitHub. It has been forked 217 times. graph-of-thoughts is written mainly in Python. It has been in active development since 2023. Its main topics are graph-of-thoughts, graph-structures, graphs, large-language-models.

Frequently asked questions

What is graph-of-thoughts?

Official Implementation of "Graph of Thoughts: Solving Elaborate Problems with Large Language Models"

Is graph-of-thoughts open source?

graph-of-thoughts is an open-source project.

Is graph-of-thoughts free?

Yes. graph-of-thoughts is free and open source — you can use, modify and self-host it.

What language is graph-of-thoughts written in?

graph-of-thoughts is written mainly in Python.

🏅 Maintainer of this project?
olud.ai badge — graph-of-thoughts

Add this live badge to your README — your GitHub stars and directory rank, refreshed daily.

[![olud.ai](https://olud.ai/badge.php?tool=spcl-graph-of-thoughts)](https://olud.ai/project/spcl-graph-of-thoughts.html)
More badge options →
🧬 Shares DNA with🧬 View the DNA map →

Measured from GitHub topics shared by both projects, weighted by how rare each topic is.