oxicuda-graphalg 0.3.0

OxiCUDA: Classical graph algorithms (BFS/DFS, shortest paths, MST, max-flow, matching, SCC, centrality, community, TSP, coloring, isomorphism)
Documentation
1
2
3
4
5
6
7
8
9
10
11
//! Graph traversal: BFS, DFS (recursive + iterative), IDDFS, bidirectional BFS.

pub mod bfs;
pub mod bidirectional_bfs;
pub mod dfs;
pub mod iddfs;

pub use bfs::{bfs_levels, bfs_parents};
pub use bidirectional_bfs::bidirectional_bfs;
pub use dfs::{dfs_iterative, dfs_postorder, dfs_preorder};
pub use iddfs::iddfs_search;