What is the Neural Link?

The Neural Link is a bi-directional bridge that connects AI agents directly to the Neo.mjs runtime. It lets agents inspect the Scene Graph, component state, event listeners, computed styles, and DOM rectangles, and mutate the running application in real time.

Why is Neo.mjs called an Application Engine instead of a framework?

Neo.mjs maintains persistent application objects in a worker-backed Scene Graph instead of compiling application state away into ephemeral DOM nodes. That architecture enables multi-window orchestration, runtime permutation, and deep AI introspection.

What is Context Engineering?

Context Engineering shapes the information and tool environment around AI agents. Neo.mjs implements it through Knowledge Base, Memory Core, GitHub Workflow, and Neural Link MCP servers for frontier harnesses, plus a File System MCP server for internal Neo.ai.Agent local loops.

What is the Neo.mjs Agent OS?

The Neo.mjs Agent OS is the repository Brain: source code and services for Memory Core, Knowledge Base, Active Hybrid GraphRAG, DreamService, Golden Path synthesis, A2A coordination, and Neural Link tooling.

Frontmatter

id	9682
title	Native Edge Graph: Traversal Query Engine & Aggregations
state	Closed
labels	enhancementai
assignees	tobiu
createdAt	Apr 4, 2026, 3:42 AM
updatedAt	Apr 4, 2026, 4:01 AM
githubUrl	https://github.com/neomjs/neo/issues/9682
author	tobiu
commentsCount	1
parentIssue	9673
subIssues	[]
subIssuesCompleted	0
subIssuesTotal	0
contentTrust
projected
quarantined	0
signals	[]
blockedBy	[]
blocking	[]
closedAt	Apr 4, 2026, 3:58 AM

Native Edge Graph: Traversal Query Engine & Aggregations

Closed v13.0.0/archive-v13-0-0-chunk-2 enhancementai

tobiu commented on Apr 4, 2026, 3:42 AM

Native Edge Graph: Traversal Query Engine & Aggregations

This Epic introduces a fully functional stateless Traversal Query Engine scaling N-hop path lookups and optimal routing for Neo's memory core Graph Database.

Features Implemented

Functional Architecture: Neo.ai.graph.queries.Traversal.mjs implements a purely functional getPaths & findShortestPath design without massive Neo.core.Base class overheads natively scaling iteration logic dynamically.
Predicated Halt Routing: Expanded traversal engines directly parsing matchPredicate and stopPredicate lambda mappings bounding Graph paths avoiding looping matrices safely.
Min-Heap Dijkstra Paths: Fully structured topological bounds mapped using customizable weightFunction edge arrays natively avoiding excessive looping allocations cleanly rendering optimal routes natively.

tobiu Apr 4, 2026, 3:58 AM

Implemented full functional Native Edge Traversal Engine (#9682) providing stateless Dijkstra routing paths properly bounded by lambda-predicate evaluations inside tight recursive loops safely cleanly avoiding Neo.core.Base overheads.