pub async fn graph_expand(
store: &dyn GraphStore,
seed: Uuid,
depth: u8,
as_of: DateTime<Utc>,
) -> Result<Vec<Uuid>>Expand description
Bounded BFS from seed that respects bitemporal validity at
as_of and a max walk depth.
Returns every UUID reachable through edges whose
valid_from <= as_of < valid_to.unwrap_or(MAX). Self-loops are
dropped. The seed is included in the returned set unless the
caller filters it out themselves.