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.
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?
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.