Struct Node 

pub struct Node {
    pub name: String,
    pub path: String,
    pub node_type: String,
    pub description: String,
    pub dependencies: Vec<String>,
    pub provides: Vec<String>,
    pub status: String,
    pub build_order: u32,
}

Represents a node in the topology graph

Fields

name: String

Node name/identifier

path: String

File system path for the node

node_type: String

Type of the node (e.g., “crate”, “service”, “workflow”)

description: String

Human-readable description

dependencies: Vec<String>

List of dependencies (nodes this node depends on)

provides: Vec<String>

List of capabilities this node provides

status: String

Current status (e.g., “active”, “inactive”, “deprecated”)

build_order: u32

Build order for topological sorting

Trait Implementations

impl Clone for Node

fn clone(&self) -> Node

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Node

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Node

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for Node

fn eq(&self, other: &Node) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for Node

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for Node