Graph indexing and integrity #6

Closed
opened 2026-01-31 16:50:52 +01:00 by erikinkinen · 0 comments
Owner

Goal
Make traversal efficient and deterministic.

Steps

  • Add adjacency indexes (outgoing per subject)
  • Add reverse indexes (incoming per object)
  • Implement validate_graph() invariant checker
  • Enforce deterministic iteration order
**Goal** Make traversal efficient and deterministic. **Steps** * [x] Add adjacency indexes (outgoing per subject) * [x] Add reverse indexes (incoming per object) * [x] Implement `validate_graph()` invariant checker * [x] Enforce deterministic iteration order
erikinkinen added this to the Phase 0 milestone 2026-01-31 16:50:52 +01:00
Sign in to join this conversation.
No milestone
No assignees
1 participant
Notifications
Due date
The due date is invalid or out of range. Please use the format "yyyy-mm-dd".

No due date set.

Dependencies

No dependencies set.

Reference
erikinkinen/AES#6
No description provided.