JevMade field notes / Technical guide

Find a route through connected information with Jev

Neo4j keeps information as items joined by named relationships. This demonstration asks Jev about sampled nearby links and can continue along several promising routes toward a goal.

Original by jexpRetrieval

Listen to this guide

JevMade’s plain-English explanation

0:00 /

AI narration

Credits and license

“neo4jev — Graph Navigation Demo (TypeSafe Jev + Neo4j)” by jexp. Read the original source.

This expanded guide is an AI-narrated adaptation of the source’s essential explanation, examples and caveats, not a word-for-word reading. The synthetic voice does not imitate the author or imply their endorsement.

License: MIT

MIT License

Copyright (c) 2026 Michael Hunger

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.

Our summary

Neo4j stores information as connected items: each link describes how two items relate. This demonstration starts at one item and gives Jev a goal. It supplies existing nearby links rather than asking the model to invent a whole route through the information.

The program samples nearby links and asks Jev which to follow and whether the goal has been reached. It may keep several promising links and repeat from each new position. The search can therefore produce several candidate routes, not just one chain of single choices.

Each sample has a size limit, so omitted links cannot be chosen even if they lead to the goal. A promising route need not be correct or shortest. Check repeated visits and step limits, and remember that the information shown to Jev leaves the database.

Key takeaways

Offer existing links rather than invented connections.
Keep several promising routes when the search branches.
Sampling can miss useful links, and a high-ranked route is not guaranteed correct.

More guides →See the experiments →