Struct WikiGraph 

pub struct WikiGraph { /* private fields */ }

In-memory directed graph of wiki pages and their [[wikilink]] connections.

Implementations

impl WikiGraph

pub fn new() -> Self

pub fn upsert_node( &mut self, slug: &str, title: &str, is_placeholder: bool, ) -> NodeIndex

Add or update a node. Returns its NodeIndex.

pub fn remove_node(&mut self, slug: &str)

Remove a node and all its edges.

pub fn set_outgoing_edges(&mut self, source_slug: &str, target_slugs: &[String])

Set outgoing edges FROM a source node.

Removes all existing outgoing edges first, then adds new ones. Creates placeholder nodes for targets that don’t exist. Duplicate targets are deduplicated — at most one edge per (source, target) pair.

pub fn get_backlinks(&self, slug: &str) -> Vec<String>

Get all slugs that link TO a given slug (backlinks / incoming). Results are sorted by slug for deterministic output.

pub fn get_forward_links(&self, slug: &str) -> Vec<String>

Get all slugs that a given slug links TO (forward links / outgoing). Results are sorted by slug for deterministic output.

pub fn degree(&self, slug: &str) -> usize

Get the degree (total edges in + out) of a node.

pub fn cleanup_orphaned_placeholders(&mut self) -> Vec<String>

Remove placeholder nodes that have zero edges. Returns the slugs of removed nodes.

Uses batched removal with a single index rebuild at the end, avoiding the O(n * k) cost of rebuilding after each removal.

pub fn get_full_graph(&self) -> (Vec<GraphNode>, Vec<GraphEdge>)

Get full graph data for serialization. Nodes sorted by slug, edges sorted by (source, target) for deterministic output.

pub fn stats(&self) -> (usize, usize)

Get node and edge counts.

Trait Implementations

impl Default for WikiGraph

fn default() -> Self

Returns the “default value” for a type.