Struct DependencyGraph 

pub struct DependencyGraph {
    pub adjacency_list: HashMap<String, Vec<String>>,
    pub reverse_dependencies: HashMap<String, Vec<String>>,
    pub strongly_connected_components: Vec<Vec<String>>,
    pub topological_order: Option<Vec<String>>,
}

Graph representation of trait dependencies

Fields

adjacency_list: HashMap<String, Vec<String>>

Adjacency list representation of the dependency graph

reverse_dependencies: HashMap<String, Vec<String>>

Reverse dependency mapping (dependents of each trait)

strongly_connected_components: Vec<Vec<String>>

Strongly connected components (for cycle detection)

topological_order: Option<Vec<String>>

Topologically sorted order (if no cycles)

Trait Implementations

impl Clone for DependencyGraph

fn clone(&self) -> DependencyGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DependencyGraph

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

Formats the value using the given formatter.

impl Default for DependencyGraph

fn default() -> DependencyGraph

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for DependencyGraph

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for DependencyGraph

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

where __S: Serializer,

Serialize this value into the given Serde serializer.