Struct DFS 

pub struct DFS;

Depth-First Search for deep graph exploration

Use for finding paths, detecting cycles, topological sorting. Time: O(V + E), Space: O(V)

Implementations

impl DFS

pub fn find_path( graph: &GraphStore, source: &str, target: &str, ) -> ShortestPathResult

Find any path from source to target (not necessarily shortest)

pub fn traverse(graph: &GraphStore, source: &str) -> Vec<String>

DFS traversal returning all nodes in DFS order

pub fn all_paths( graph: &GraphStore, source: &str, target: &str, max_depth: usize, ) -> AllPathsResult

Find all paths from source to target (with depth limit)

pub fn topological_sort(graph: &GraphStore) -> Option<Vec<String>>

Topological sort (returns None if graph has cycles)