Struct GraphAlgorithms 

pub struct GraphAlgorithms;

グラフアルゴリズムマネージャー

Implementations

impl GraphAlgorithms

pub fn shortest_path_dijkstra( graph: &Graph, source: VertexId, weight_fn: impl Fn(&EdgeData) -> u64, ) -> Result<ShortestPathResult>

Dijkstraのアルゴリズムで最短経路を計算

pub fn shortest_path_bellman_ford( graph: &Graph, source: VertexId, weight_fn: impl Fn(&EdgeData) -> u64, ) -> Result<ShortestPathResult>

Bellman-Fordアルゴリズム（負の重み対応）

pub fn all_pairs_shortest_paths( graph: &Graph, weight_fn: impl Fn(&EdgeData) -> u64, ) -> Result<HashMap<(VertexId, VertexId), u64>>

Floyd-Warshallアルゴリズム（全頂点間最短経路）

pub fn shortest_path_astar( graph: &Graph, source: VertexId, target: VertexId, weight_fn: impl Fn(&EdgeData) -> u64, heuristic_fn: impl Fn(VertexId, VertexId) -> u64, ) -> Result<Option<Vec<VertexId>>>

A*アルゴリズム（ヒューリスティック使用）

pub fn degree_centrality(graph: &Graph, normalized: bool) -> CentralityResult

次数中央性を計算

pub fn betweenness_centrality( graph: &Graph, normalized: bool, ) -> CentralityResult

媒介中央性を計算（Brandesのアルゴリズム）

pub fn closeness_centrality(graph: &Graph, normalized: bool) -> CentralityResult

近接中央性を計算

pub fn pagerank( graph: &Graph, damping_factor: f64, max_iterations: usize, tolerance: f64, ) -> CentralityResult

PageRankを計算（べき乗法）

pub fn subgraph_isomorphism( pattern: &Graph, target: &Graph, ) -> PatternMatchResult

基本的な部分グラフ同型マッチング（Ullmannのアルゴリズム簡易版）

Trait Implementations

impl Debug for GraphAlgorithms

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

Formats the value using the given formatter.