How it uses Jev
At each visited Neo4j node, the navigator sends outgoing relationship descriptions as Choice options and asks a Noul question about whether the goal has been reached. The code advances through selected edges and can use beam search to retain paths.
What Jev decides
Has the navigation goal already been reached at the current node, before following another relationship?
The current graph node, navigation goal, hop index, and path so far.
App workflow
- Discover graph context
Connect to Neo4j and inspect graph labels, properties, and outgoing relationships.
- Choose a graph edge
Build a bounded Choice over the current node’s outgoing edges and a goal-reached Noul.
- Advance candidate paths
Advance candidate paths using Jev answers and beam-search bookkeeping.
- Visualize exploration
Render the explored graph and path in the notebook or Streamlit interface.
Why it is interesting
The navigator makes a paired Choice and Noul call at each graph node, then uses returned probabilities to expand candidate paths.