Struct AuthorityGraph 

pub struct AuthorityGraph {
    pub source: PipelineSource,
    pub nodes: Vec<Node>,
    pub edges: Vec<Edge>,
    pub completeness: AuthorityCompleteness,
    pub completeness_gaps: Vec<String>,
    pub metadata: HashMap<String, String>,
    pub parameters: HashMap<String, ParamSpec>,
}

Directed authority graph. Nodes are pipeline elements (steps, secrets, artifacts, identities, images). Edges model authority/data flow.

Fields

source: PipelineSource

nodes: Vec<Node>

edges: Vec<Edge>

completeness: AuthorityCompleteness

How complete is this graph? Set by the parser based on what it could resolve.

completeness_gaps: Vec<String>

Human-readable reasons why the graph is Partial (if applicable).

metadata: HashMap<String, String>

Graph-level metadata set by parsers (e.g. trigger type, platform-specific flags).

parameters: HashMap<String, ParamSpec>

Top-level pipeline parameters: declarations, keyed by parameter name. Populated by parsers that surface parameter metadata (currently ADO). Empty for platforms / pipelines that don’t declare parameters.

Implementations

impl AuthorityGraph

pub fn new(source: PipelineSource) -> Self

pub fn mark_partial(&mut self, reason: impl Into<String>)

Mark the graph as partially complete with a reason.

pub fn add_node( &mut self, kind: NodeKind, name: impl Into<String>, trust_zone: TrustZone, ) -> NodeId

Add a node, returns its ID.

pub fn add_node_with_metadata( &mut self, kind: NodeKind, name: impl Into<String>, trust_zone: TrustZone, metadata: HashMap<String, String>, ) -> NodeId

Add a node with metadata, returns its ID.

pub fn add_edge(&mut self, from: NodeId, to: NodeId, kind: EdgeKind) -> EdgeId

Add a directed edge, returns its ID.

pub fn edges_from(&self, id: NodeId) -> impl Iterator<Item = &Edge>

Outgoing edges from a node.

pub fn edges_to(&self, id: NodeId) -> impl Iterator<Item = &Edge>

Incoming edges to a node.

pub fn authority_sources(&self) -> impl Iterator<Item = &Node>

All authority-bearing source nodes (Secret + Identity). These are the BFS start set for propagation analysis.

pub fn nodes_of_kind(&self, kind: NodeKind) -> impl Iterator<Item = &Node>

All nodes of a given kind.

pub fn nodes_in_zone(&self, zone: TrustZone) -> impl Iterator<Item = &Node>

All nodes in a given trust zone.

pub fn node(&self, id: NodeId) -> Option<&Node>

Get a node by ID.

pub fn edge(&self, id: EdgeId) -> Option<&Edge>

Get an edge by ID.

Trait Implementations

impl Clone for AuthorityGraph

fn clone(&self) -> AuthorityGraph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for AuthorityGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for AuthorityGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for AuthorityGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.