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 |
| blockedBy | [] |
| blocking | [] |
| closedAt | Apr 4, 2026, 3:58 AM |
Native Edge Graph: Traversal Query Engine & Aggregations
Closedenhancementai
tobiu added parent issue #9673 on Apr 4, 2026, 3:42 AM
tobiu assigned to @tobiu on Apr 4, 2026, 3:47 AM

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.
tobiu closed this issue on Apr 4, 2026, 3:58 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
Neo.ai.graph.queries.Traversal.mjsimplements a purely functionalgetPaths&findShortestPathdesign without massiveNeo.core.Baseclass overheads natively scaling iteration logic dynamically.matchPredicateandstopPredicatelambda mappings bounding Graph paths avoiding looping matrices safely.weightFunctionedge arrays natively avoiding excessive looping allocations cleanly rendering optimal routes natively.