Struct Graph 

pub struct Graph {
    pub project: Option<ProjectMeta>,
    pub nodes: Vec<Node>,
    pub edges: Vec<Edge>,
}

A complete GID graph with nodes and edges.

Fields

project: Option<ProjectMeta>

nodes: Vec<Node>

edges: Vec<Edge>

Implementations

impl Graph

pub fn new() -> Self

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

pub fn get_node_mut(&mut self, id: &str) -> Option<&mut Node>

pub fn add_node(&mut self, node: Node)

pub fn remove_node(&mut self, id: &str) -> Option<Node>

pub fn update_status(&mut self, id: &str, status: NodeStatus) -> bool

pub fn add_edge(&mut self, edge: Edge)

pub fn remove_edge(&mut self, from: &str, to: &str, relation: Option<&str>)

pub fn edges_from(&self, id: &str) -> Vec<&Edge>

pub fn edges_to(&self, id: &str) -> Vec<&Edge>

pub fn ready_tasks(&self) -> Vec<&Node>

Get tasks that are ready (todo + all depends_on are done).

pub fn tasks_by_status(&self, status: &NodeStatus) -> Vec<&Node>

Get tasks by status.

pub fn summary(&self) -> GraphSummary

Summary statistics.

pub fn summary_text(&self) -> String

Get a human-readable text summary of the graph state.

pub fn health(&self) -> f64

Calculate graph health score (0.0 to 1.0).

Health is based on:

• Progress: ratio of done tasks to total
• Flow: ratio of ready tasks to remaining (non-blocked) tasks
• Connectivity: graphs with edges are healthier than isolated nodes

Returns 1.0 for a fully complete graph, 0.0 for an empty or stuck graph.

pub fn mark_task_done(&mut self, node_id: &str) -> bool

Mark a task as done. Returns true if found and updated.

pub fn get_executable_tasks(&self) -> Vec<Task>

Get executable tasks (alias for ready_tasks, returns owned Task structs).

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Graph

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

Formats the value using the given formatter.

impl Default for Graph

fn default() -> Graph

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for Graph

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl KnowledgeGraph for Graph

fn get_knowledge_mut(&mut self, node_id: &str) -> Option<&mut KnowledgeNode>

Get mutable access to a node’s knowledge storage

fn get_knowledge(&self, node_id: &str) -> Option<&KnowledgeNode>

Get read access to a node’s knowledge storage

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

Get edges pointing to a node (for upstream lookups)

impl KnowledgeManagement for Graph

fn store_finding(&mut self, node_id: &str, key: &str, value: &str) -> Result<()>

Store a finding in a node

fn get_finding(&self, node_id: &str, key: &str) -> Option<String>

Get a finding from a node or any upstream node

fn get_upstream_findings(&self, node_id: &str, key: &str) -> Option<String>

Get finding from upstream nodes recursively

fn cache_file(&mut self, node_id: &str, path: &str, content: &str) -> Result<()>

Cache file content in a node

fn get_cached_file(&self, node_id: &str, path: &str) -> Option<String>

Get cached file from this node or upstream

fn record_tool_call( &mut self, node_id: &str, tool_name: &str, summary: &str, ) -> Result<()>

Record a tool call

fn get_tool_history(&self, node_id: &str) -> Vec<ToolCallRecord>

Get all tool calls from this and upstream nodes

fn get_knowledge_context(&self, node_id: &str) -> String

Get all findings from this and upstream nodes as formatted context

fn collect_upstream_findings_all( &self, node_id: &str, findings: &mut HashMap<String, String>, )

Helper to collect all findings recursively

impl Serialize for Graph

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

where __S: Serializer,

Serialize this value into the given Serde serializer.