Struct WorkflowGraph

pub struct WorkflowGraph {
    nodes: HashMap<String, Node>,
    edges: Vec<Edge>,
    adjacency: HashMap<String, Vec<String>>,
    in_degree: HashMap<String, usize>,
}

Fields

nodes: HashMap<String, Node>

edges: Vec<Edge>

adjacency: HashMap<String, Vec<String>>

in_degree: HashMap<String, usize>

Implementations

impl WorkflowGraph

pub fn from_workflow(workflow: &Workflow) -> Self

pub fn get_execution_order(&self) -> Result<Vec<String>>

pub fn get_parallel_groups(&self) -> Result<Vec<Vec<String>>>

pub fn get_node(&self, node_id: &str) -> Option<&Node>

pub fn get_dependencies(&self, node_id: &str) -> Vec<String>

pub fn get_nodes_with_no_dependencies(&self) -> Vec<String>

pub fn get_downstream_nodes(&self, node_id: &str) -> Vec<String>