Shell Game: three agents, one graph, and a 3-hop path to a sanctions list
Built for Graph Hacks (WeMakeDevs × FalkorDB). Code: https://github.com/MIGHTYASJED/shellgame · Live:...
Tag archive
Built for Graph Hacks (WeMakeDevs × FalkorDB). Code: https://github.com/MIGHTYASJED/shellgame · Live:...
Why I put my agent's memory in a graph Built for Graph Hacks (WeMakeDevs × FalkorDB) — the...

How I built LastLift for Graph Hacks: Boston's subway as a flow network in FalkorDB, certified...
I built Klotski (Hakoiri Musume, L'Âne rouge, Huarong Dao) in the browser, with every position...
Entity resolution at scale starts with a problem most introductions skip: you can't compare every...

These two get used interchangeably in agent-memory discussions, and they are not the same idea. They...

I asked my system how a request gets handled. It returned one function, which was the handler whose...

For the past two years, "AI Agent" development has been dominated by Loop Engineering. We’ve all...
Standard knowledge graph edges are timeless by default. When you insert "Company X → CEO → Person A,"...
A CLI that finds shortest paths in a weighted graph, in Rust, with Dijkstra's algorithm. Three...
make targets, npm dependencies, task ordering — "do B and C before A" is a dependency graph, and...
AlgoGraph is an immutable graph library for Python with pipe-based transformers, declarative selectors, and lazy views.