Struct ControlGraph 

pub struct ControlGraph { /* private fields */ }

Implementations

impl ControlGraph

pub fn build(snap: &Snapshot) -> Self

pub fn build_with(snap: &Snapshot, schema: &SchemaMap) -> Self

ControlGraph::build with a forest schema map, so ACEs on LAPS / gMSA / dMSA attributes — whose GUIDs differ per forest — become edges too.

pub fn paths_to_tier0(&self) -> Vec<AttackPath>

Every principal that can reach any Tier-0 node, with the cheapest route and the exact steps it walks.

Dijkstra runs backwards from each Tier-0 node over incoming edges, so the recorded predecessor is the next hop forwards — reversing it yields the attacker’s route.

pub fn stats(&self) -> (usize, usize)

pub fn direct_edges_to_tier0(&self, kind: EdgeKind) -> Vec<(String, String)>

Direct kind edges from a non-Tier-0 principal into a Tier-0 node.