Struct DependencyGraph 

pub struct DependencyGraph {
    pub root: String,
    pub root_version: String,
    pub edges: Vec<DependencyEdge>,
    pub nodes: HashMap<String, String>,
}

Dependency graph representation

Fields

root: String

root_version: String

edges: Vec<DependencyEdge>

nodes: HashMap<String, String>

Implementations

impl DependencyGraph

pub fn new(root_name: &str, root_version: &str) -> Self

Create a new dependency graph with a root plugin

pub fn add_dependency(&mut self, edge: DependencyEdge)

Add a dependency edge

pub fn detect_circular_dependencies(&self) -> Vec<CircularDependency>

Detect circular dependencies using DFS

pub fn build_tree(&self) -> DependencyNode

Build a dependency tree from the graph

pub fn calculate_metrics(&self) -> DependencyMetrics

Calculate dependency metrics

pub fn to_dot(&self) -> String

Generate DOT format for Graphviz visualization

pub fn to_json(&self) -> Value

Generate JSON representation

pub fn direct_dependencies(&self, node_name: &str) -> Vec<String>

Get all direct dependencies of a node

pub fn transitive_dependencies(&self, node_name: &str) -> Vec<String>

Get all transitive dependencies

pub fn shortest_path(&self, from: &str, to: &str) -> Option<Vec<String>>

Find the shortest path between two nodes

pub fn node_depth(&self, node_name: &str) -> Option<u32>

Get depth of a node from root