Playground Checkpoint
Design and build a real schema — no auto-grading, just a real attempt.
The Challenge
Six chapters of real graph modelling, all converging on one real challenge: trace GreenMart's actual fraud ring, the way this whole Act argued it should be found — not by reviewing accounts one at a time, but by walking the relationships between them.
Open the Playground and build it for real: create at least four Account nodes plus a shared Device and a shared Card, connect them with a mix of REFERRED_BY, SHARED_DEVICE, and SHARED_CARD relationships, run a real traversal, and find the shortest path between two accounts that share no direct relationship at all.
What Your Fraud Ring Needs
- At least four Account nodes, plus one Device node and one Card node — the same shape this Act's own fraud examples used.
- At least one REFERRED_BY relationship between two Account nodes.
- At least one SHARED_DEVICE relationship and one SHARED_CARD relationship, arranged so two specific accounts end up connected only indirectly — through the device or card, not through a direct REFERRED_BY link between themselves.
- One MATCH traversal that finds accounts connected by REFERRED_BY.
- One SHORTEST_PATH call between two accounts that have no direct relationship with each other — it should find a real path through the shared device or card.
Stuck? A Few Hints
- Reread fraud-detection-and-shortest-paths' own worked example — this checkpoint reuses the exact same shape (accounts, a device, a card), just with your own node variable names and ids.
- SHORTEST_PATH needs bound variables (nodes already created or matched earlier in the same script), not arbitrary id strings in quotes — use the same variable names your CREATE statements already used.
- Check the "Graph state" panel after running your CREATEs — it lists every relationship as a real edge, which is the fastest way to confirm your two target accounts genuinely have no direct connection before you run SHORTEST_PATH.
Ready to Build It?
Opens the Playground, right in your browser — nothing to install.
Every command should return a real result — a created node/relationship, a list of matched nodes and relationships, or a found path. SHORTEST_PATH between your two indirectly-connected accounts should report a real path (more than 1 hop) — that's the checkpoint working correctly, proof the hidden connection was actually found.
Before You Move On
Four accounts, a device, a card, a REFERRED_BY traversal, and a shortest path connecting two accounts that share nothing directly — that's the whole Act, in one script: the relationship itself was the data all along, and finding the ring meant walking it, not reviewing accounts one at a time. The next Act moves from relationships between things GreenMart already knows to searching across everything GreenMart's catalog actually says.