Struct LinkGraph 

pub struct LinkGraph { /* private fields */ }

The citation graph extracted from a vault’s [[wikilinks]].

Maps note name → outgoing/incoming link sets, handles duplicate filenames across folders via path-based resolution, and retains a record-by-name map so LinkPredicate::Where can recurse the predicate into linked records.

Implementations

impl LinkGraph

pub fn build(records: &[Record]) -> Self

Build the link index from a set of records. All records must have raw_content loaded.

pub fn build_with_root(records: &[Record], vault_root: Option<&Path>) -> Self

Build with a vault root for path resolution.

pub fn record_by_name(&self, name: &str) -> Option<&Record>

Look up a record by its virtual name (filename without .md).

pub fn is_ambiguous(&self, name: &str) -> bool

Check if a filename has duplicates across folders.

pub fn paths_for_name(&self, name: &str) -> Vec<&str>

Get all paths for a given filename.

pub fn outgoing_links(&self, name: &str) -> Vec<&str>

Get outgoing links for a note.

pub fn incoming_links(&self, name: &str) -> Vec<&str>

Get incoming links (backlinks) for a note.

pub fn outgoing_count(&self, name: &str) -> usize

Count of outgoing links.

pub fn incoming_count(&self, name: &str) -> usize

Count of incoming links (backlinks).

pub fn traverse( &self, start: &str, max_depth: usize, direction: Direction, ) -> Vec<(String, usize)>

BFS traversal from a starting note. Returns (name, depth) pairs for all reachable notes within max_depth, with the starting node included at depth 0.

pub fn has_link_to(&self, from: &str, to: &str) -> bool

Check if note from has an outgoing link to note to.

pub fn has_link_from(&self, to: &str, from: &str) -> bool

Check if note to has an incoming link from note from.

pub fn unresolved(&self) -> Vec<UnresolvedLink>

All wikilinks pointing to non-existent records, returned as (source, target) pairs. Targets are normalised via the same folder-stripping rule used during graph construction.

pub fn traverse_from( &self, start: &str, depth: usize, direction: Direction, ) -> Vec<String>

BFS traversal returning just the reachable note names (without depth). The starting note itself is NOT included.

pub fn virtual_fields(&self, name: &str) -> Vec<(&'static str, Value)>

Get link data as Values for virtual fields on a record.

Trait Implementations

impl Debug for LinkGraph

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

Formats the value using the given formatter.

impl Default for LinkGraph

fn default() -> LinkGraph

Returns the “default value” for a type.