use alloc::vec;
use alloc::vec::Vec;
use crate::{Task, VarId};
#[derive(Clone, Debug, PartialEq, Eq)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
pub struct CausalGraph {
successors: Vec<Vec<VarId>>,
predecessors: Vec<Vec<VarId>>,
}
impl CausalGraph {
pub fn new(task: &Task) -> Self {
let mut arcs = Vec::new();
for op in &task.operators {
for e in &op.eff {
let v = e.fact.var;
arcs.extend(op.pre.iter().map(|f| (f.var, v)));
arcs.extend(e.conditions.iter().map(|f| (f.var, v)));
arcs.extend(op.eff.iter().map(|other| (other.fact.var, v)));
}
}
for a in &task.axioms {
arcs.extend(a.conditions.iter().map(|f| (f.var, a.head.var)));
}
arcs.retain(|(u, v)| u != v);
arcs.sort_unstable();
arcs.dedup();
let n = task.num_variables();
let mut successors = vec![Vec::new(); n];
let mut predecessors = vec![Vec::new(); n];
for &(u, v) in &arcs {
successors[u].push(v);
predecessors[v].push(u);
}
Self {
successors,
predecessors,
}
}
pub fn successors(&self, var: VarId) -> &[VarId] {
&self.successors[var]
}
pub fn predecessors(&self, var: VarId) -> &[VarId] {
&self.predecessors[var]
}
}