feat(graph): identity DAG with acyclicity, root distance, and quorum soundness
I1 — CycleDetector: DFS from proposed target; rejects if it reaches source. I2 — RootDistanceIndex: multi-source BFS from all human nodes; None = no human ancestor. I3 — QuorumEngine: recursive descent; sub-org vote counts only if its quorum independently met. IdentityGraphService: unified surface enforcing all three invariants atomically. 82 TDD tests — all passing.
sha256:1e4ec712d7328e36c0b657b7020aa4eb14627a6ffdf89a2f36dab10ae1a755aa
sha
sha256:f1faf1a2de652a27f7c0d60b37ba8f887f55599b83a4c440f0d5614b7e106121
snapshot
0 comments
To add a comment, use the Muse CLI:
muse hub commit comment sha256:1e4ec712d7328e36c0b657b7020aa4eb14627a6ffdf89a2f36dab10ae1a755aa --body "your comment"
No comments yet. Be the first to start the discussion.