feat: migrate from Cedar to SpiceDB authorization system

This is a major architectural change that replaces the Cedar policy-based
authorization system with SpiceDB's relation-based authorization.

Key changes:

- Migrate from Rust to Go implementation
- Replace Cedar policies with SpiceDB schema and relationships
- Switch from envoy `ext_authz` with Cedar to SpiceDB permission checks
- Update build system and dependencies for Go ecosystem
- Maintain Envoy integration for external authorization

This change enables more flexible permission modeling through SpiceDB's
Google Zanzibar inspired relation-based system, supporting complex
hierarchical permissions that were difficult to express in Cedar.

Breaking change: Existing Cedar policies and Rust-based configuration
will no longer work and need to be migrated to SpiceDB schema.

1 files changed, 0 insertions, 73 deletions

diff --git a/vendor/petgraph/src/traits_graph.rs b/vendor/petgraph/src/traits_graph.rs
deleted file mode 100644
index 272e9e7f..00000000
--- a/vendor/petgraph/src/traits_graph.rs
+++ /dev/null
@@ -1,73 +0,0 @@
-use fixedbitset::FixedBitSet;
-
-use super::EdgeType;
-
-use super::graph::{Graph, IndexType, NodeIndex};
-#[cfg(feature = "stable_graph")]
-use crate::stable_graph::StableGraph;
-use crate::visit::EdgeRef;
-#[cfg(feature = "stable_graph")]
-use crate::visit::{IntoEdgeReferences, NodeIndexable};
-
-use super::visit::GetAdjacencyMatrix;
-
-/// The adjacency matrix for **Graph** is a bitmap that's computed by
-/// `.adjacency_matrix()`.
-impl<N, E, Ty, Ix> GetAdjacencyMatrix for Graph<N, E, Ty, Ix>
-where
-    Ty: EdgeType,
-    Ix: IndexType,
-{
-    type AdjMatrix = FixedBitSet;
-
-    fn adjacency_matrix(&self) -> FixedBitSet {
-        let n = self.node_count();
-        let mut matrix = FixedBitSet::with_capacity(n * n);
-        for edge in self.edge_references() {
-            let i = edge.source().index() * n + edge.target().index();
-            matrix.put(i);
-            if !self.is_directed() {
-                let j = edge.source().index() + n * edge.target().index();
-                matrix.put(j);
-            }
-        }
-        matrix
-    }
-
-    fn is_adjacent(&self, matrix: &FixedBitSet, a: NodeIndex<Ix>, b: NodeIndex<Ix>) -> bool {
-        let n = self.node_count();
-        let index = n * a.index() + b.index();
-        matrix.contains(index)
-    }
-}
-
-#[cfg(feature = "stable_graph")]
-/// The adjacency matrix for **Graph** is a bitmap that's computed by
-/// `.adjacency_matrix()`.
-impl<N, E, Ty, Ix> GetAdjacencyMatrix for StableGraph<N, E, Ty, Ix>
-where
-    Ty: EdgeType,
-    Ix: IndexType,
-{
-    type AdjMatrix = FixedBitSet;
-
-    fn adjacency_matrix(&self) -> FixedBitSet {
-        let n = self.node_bound();
-        let mut matrix = FixedBitSet::with_capacity(n * n);
-        for edge in self.edge_references() {
-            let i = edge.source().index() * n + edge.target().index();
-            matrix.put(i);
-            if !self.is_directed() {
-                let j = edge.source().index() + n * edge.target().index();
-                matrix.put(j);
-            }
-        }
-        matrix
-    }
-
-    fn is_adjacent(&self, matrix: &FixedBitSet, a: NodeIndex<Ix>, b: NodeIndex<Ix>) -> bool {
-        let n = self.node_count();
-        let index = n * a.index() + b.index();
-        matrix.contains(index)
-    }
-}