Struct GraphAlgorithms 

pub struct GraphAlgorithms;

Graph algorithms implementation

Implementations

impl GraphAlgorithms

pub fn pagerank( graph: &KnowledgeGraph, config: &PageRankConfig, ) -> RragResult<HashMap<String, f32>>

Calculate PageRank scores for all nodes

pub fn shortest_paths( graph: &KnowledgeGraph, source_node_id: &str, config: &TraversalConfig, ) -> RragResult<HashMap<String, PathInfo>>

Find shortest paths from a source node using Dijkstra’s algorithm

pub fn semantic_paths( graph: &KnowledgeGraph, source_node_id: &str, target_node_id: &str, config: &PathFindingConfig, ) -> RragResult<Vec<SemanticPath>>

Find semantic paths between two nodes

pub fn bfs_search( graph: &KnowledgeGraph, source_node_id: &str, config: &TraversalConfig, ) -> RragResult<Vec<String>>

Breadth-first search from a source node

pub fn dfs_search( graph: &KnowledgeGraph, source_node_id: &str, config: &TraversalConfig, ) -> RragResult<Vec<String>>

Depth-first search from a source node

pub fn strongly_connected_components(graph: &KnowledgeGraph) -> Vec<Vec<String>>

Find strongly connected components using Tarjan’s algorithm

pub fn betweenness_centrality(graph: &KnowledgeGraph) -> HashMap<String, f32>

Calculate betweenness centrality for all nodes