Struct RawGraph 

pub struct RawGraph {
    pub graph: DiGraph<String, ()>,
    pub node_map: HashMap<String, NodeIndex>,
    pub content_hash: String,
}

A directed dependency graph built from SQLite.

Nodes are item IDs (strings). An edge A → B means “A blocks B”.

RawGraph preserves all edges as stored in the projection database, including any cycles that may exist due to concurrent or inconsistent link events. Use crate::graph::normalize to condense SCCs and optionally reduce transitive edges.

Fields

graph: DiGraph<String, ()>

Directed graph: nodes = item IDs, edges = blocking relationships.

node_map: HashMap<String, NodeIndex>

Mapping from item ID to petgraph NodeIndex.

content_hash: String

BLAKE3 content hash of the edge set used for cache invalidation.

Implementations

impl RawGraph

pub fn from_sqlite(conn: &Connection) -> Result<Self>

Build a RawGraph by querying item_dependencies in conn.

Only rows where link_type IN ('blocks', 'blocked_by') are used. All non-deleted items from the items table are included as nodes (even those with no dependencies) so downstream metrics see the full node set.

The content hash is derived from the sorted list of (blocker, blocked) pairs, so it changes only when edges change.

Errors

Returns an error if the SQLite query fails.

pub fn node_count(&self) -> usize

Return the number of nodes (items) in the graph.

pub fn edge_count(&self) -> usize

Return the number of edges (blocking relationships) in the graph.

pub fn node_index(&self, item_id: &str) -> Option<NodeIndex>

Look up the NodeIndex for an item ID.

pub fn item_id(&self, idx: NodeIndex) -> Option<&str>

Return the item ID label for a node.

Trait Implementations

impl Debug for RawGraph

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

Formats the value using the given formatter.