Struct LinkGraph 

pub struct LinkGraph { /* private fields */ }

Link graph for analyzing vault relationships

Implementations

impl LinkGraph

pub fn new() -> Self

Create a new link graph

pub fn add_file(&mut self, file: &VaultFile) -> Result<()>

Add a file to the graph

pub fn remove_file(&mut self, path: &PathBuf) -> Result<()>

Remove a file from the graph

pub fn update_links(&mut self, file: &VaultFile) -> Result<()>

Add links from a parsed file to the graph

pub fn backlinks(&self, path: &PathBuf) -> Result<Vec<(PathBuf, Vec<Link>)>>

Get all backlinks to a file (files that link to this file)

pub fn forward_links(&self, path: &PathBuf) -> Result<Vec<(PathBuf, Vec<Link>)>>

Get all forward links from a file (files this file links to)

pub fn orphaned_notes(&self) -> Vec<PathBuf>

Find all orphaned notes (no incoming or outgoing links)

pub fn related_notes( &self, path: &PathBuf, max_hops: usize, ) -> Result<Vec<PathBuf>>

Find related notes within N hops (breadth-first search)

pub fn cycles(&self) -> Vec<Vec<PathBuf>>

Find strongly connected components (cycles in the graph)

pub fn stats(&self) -> GraphStats

Get statistics about the graph

pub fn all_files(&self) -> Vec<PathBuf>

Get all file paths in the graph

pub fn node_count(&self) -> usize

Get node count

pub fn edge_count(&self) -> usize

Get edge count

pub fn incoming_links(&self, path: &PathBuf) -> Result<Vec<Link>>

Get incoming links to a file (just the Link objects)

pub fn outgoing_links(&self, path: &PathBuf) -> Result<Vec<Link>>

Get outgoing links from a file (just the Link objects)

pub fn all_links(&self) -> HashMap<PathBuf, Vec<Link>>

Get all links in the graph, grouped by source file

pub fn connected_components(&self) -> Result<Vec<Vec<PathBuf>>>

Find connected components in the graph (using undirected view)

Trait Implementations

impl Default for LinkGraph

fn default() -> Self

Returns the “default value” for a type.