Show HN: A Simple GraphRAG Implementation (github.com)

30 points by gusye 1y ago ↗ HN

I made a simple GraphRAG call nano-graphrag. The reason is I try to hack the official implementation released by Microsoft but that version is very hard to read/hack. This algorithm should not be implemented that annoying, I think. So I made a simpler one.

It's about 800-900 lines of Python, and it's portable.

5 comments

[ 3.0 ms ] story [ 24.6 ms ] thread

vintagedave 1y ago ↗

This is really neat. It seems clear and usable… I may try it out in one of my projects and I hope you see lots of interest / success with it.

383toast 1y ago ↗

I love that you had an "issues" section https://github.com/gusye1234/nano-graphrag?tab=readme-ov-fil...

but how does that affect the performance, theoretically?

383toast 1y ago ↗

performance vs GraphRAG in terms of accuracy, etc.

gusye 1y ago ↗

Yeah, that's something I definitely love to add in next few days. I plan to use one of the Test Dataset from GraphRAG paper.

[dead] gkorland 1y ago ↗

[dead]