Struct ComponentGraph

pub struct ComponentGraph {
    pub graph: Graph<Component, ()>,
}

ComponentGraph is a graph of components and their relationships. Components are nodes and relationships are edges.

Fields

graph: Graph<Component, ()>

Implementations

impl ComponentGraph

Represents a graph of components and their relationships.

pub fn new() -> Self

Creates a new empty ComponentGraph.

pub fn has_component(&self, key: &str, file_path: &PathBuf) -> bool

Checks if a component exists in the graph. A component is uniquely identified by its name and file path.

pub fn has_edge(&self, from: NodeIndex, to: NodeIndex) -> bool

Checks if an edge exists between two components.

pub fn get_component(&self, key: &str, file_path: &PathBuf) -> Option<NodeIndex>

Tries to find the index of a component in the graph.

pub fn add_component(&mut self, key: String, file_path: PathBuf) -> NodeIndex

Adds a new component to the graph. If the component already exists, it returns the existing component’s index. Otherwise, it adds a new component and returns the index of the new component.

pub fn add_child(&mut self, parent: (&str, &PathBuf), child: (&str, &PathBuf))

Adds a child edge between two components.

pub fn add_prop_usage( &mut self, component: &str, file_path: &PathBuf, prop: String, )

Adds a prop usage to a component. If the component does not exist, it does nothing.

pub fn print_graph(&self)

Prints the graph to the console.

pub fn to_serializable(&self) -> SerializableComponentGraph

Converts the graph to a serializable format. This can be used to save the graph to a file or to send it over the network.

pub fn from_serializable(serializable: SerializableComponentGraph) -> Self

Converts a serializable graph back to a ComponentGraph. This can be used to load a graph from a file or to receive it over the network.

Trait Implementations

impl Debug for ComponentGraph

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

Formats the value using the given formatter.