Home Projects graphiti
graphiti
Python

graphiti

Build Real-Time Knowledge Graphs for AI Agents

by getzep · GitHub
Top 5% most starred in the catalogue
Stars
Forks
License
Created
Last commit
Category
Language
agentsgraphllmsApache-2.0Python
View on GitHub
In plain words

Create and query dynamic knowledge graphs that adapt over time for AI agents.

From the README

Install
pip install graphiti-core

Excerpts from the project README on GitHub. Copyright and licensing remain with the respective authors.

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 →
graphiti — GitHub preview card
📈 Star history
30k28k
2026-06-272026-08-31
📈 Track graphiti

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

Build Real-Time Knowledge Graphs for AI Agents

graphiti has 30.4k stars on GitHub. It has been forked 3.1k times. graphiti is written mainly in Python. It has been in active development since 2024. graphiti is available under the Apache-2.0 license. Its main topics are agents, graph, llms, rag.

Frequently asked questions

What is graphiti?

Build Real-Time Knowledge Graphs for AI Agents

Is graphiti open source?

graphiti is an open-source project. It is released under the Apache-2.0 license.

Is graphiti free?

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

What license does graphiti use?

graphiti is available under the Apache-2.0 license.

What language is graphiti written in?

graphiti is written mainly in Python.

🏅 Maintainer of this project?
olud.ai badge — graphiti

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

[![olud.ai](https://olud.ai/badge.php?tool=getzep-graphiti)](https://olud.ai/project/getzep-graphiti.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.