add algorithms to detect cycle in graph

Signed-off-by: Pritam Singh <[email protected]>

Author: Zzocker

DIRECTORY.md

@@ -143,6 +143,7 @@
     * [Tarjans Ssc](https://github.com/TheAlgorithms/Rust/blob/master/src/graph/tarjans_ssc.rs)
     * [Topological Sort](https://github.com/TheAlgorithms/Rust/blob/master/src/graph/topological_sort.rs)
     * [Two Satisfiability](https://github.com/TheAlgorithms/Rust/blob/master/src/graph/two_satisfiability.rs)
+    * [Cycle Detection](https://github.com/TheAlgorithms/Rust/blob/master/src/graph/detect_cycle.rs)
   * [Lib](https://github.com/TheAlgorithms/Rust/blob/master/src/lib.rs)
   * Machine Learning
     * [Cholesky](https://github.com/TheAlgorithms/Rust/blob/master/src/machine_learning/cholesky.rs)

src/graph/detect_cycle.rs

@@ -0,0 +1,221 @@
+use std::collections::{HashMap, HashSet, VecDeque};
+
+use crate::data_structures::{graph::Graph, DirectedGraph, UndirectedGraph};
+
+pub trait DetectCycle {
+    fn detect_cycle_dfs(&self) -> bool;
+    fn detect_cycle_bfs(&self) -> bool;
+}
+
+// Helper function to detect cycle in an undirected graph using DFS graph traversal
+fn undirected_graph_detect_cycle_dfs<'a>(
+    graph: &'a UndirectedGraph,
+    visited_node: &mut HashSet<&'a String>,
+    parent: &'a String,
+    u: &'a String,
+) -> bool {
+    visited_node.insert(u);
+    for (v, _) in graph.adjacency_table().get(u).unwrap() {
+        if v == parent {
+            continue;
+        }
+        if visited_node.contains(v) || undirected_graph_detect_cycle_dfs(graph, visited_node, u, v)
+        {
+            return true;
+        }
+    }
+    false
+}
+
+// Helper function to detect cycle in an undirected graph using BFS graph traversal
+fn undirected_graph_detect_cycle_bfs<'a>(
+    graph: &'a UndirectedGraph,
+    visited_node: &mut HashSet<&'a String>,
+    u: &'a String,
+) -> bool {
+    visited_node.insert(u);
+
+    // Initialize the queue for BFS, storing (current node, parent node) tuples
+    let mut queue = VecDeque::<(&String, &String)>::new();
+    queue.push_back((u, u));
+
+    while let Some((u, parent)) = queue.pop_front() {
+        for (v, _) in graph.adjacency_table().get(u).unwrap() {
+            if v == parent {
+                continue;
+            }
+            if visited_node.contains(v) {
+                return true;
+            }
+            visited_node.insert(v);
+            queue.push_back((v, u));
+        }
+    }
+    false
+}
+
+impl DetectCycle for UndirectedGraph {
+    fn detect_cycle_dfs(&self) -> bool {
+        let mut visited_node = HashSet::<&String>::new();
+        let adj = self.adjacency_table();
+        for u in adj.keys() {
+            if !visited_node.contains(u)
+                && undirected_graph_detect_cycle_dfs(self, &mut visited_node, u, u)
+            {
+                return true;
+            }
+        }
+        false
+    }
+
+    fn detect_cycle_bfs(&self) -> bool {
+        let mut visited_node = HashSet::<&String>::new();
+        let adj = self.adjacency_table();
+        for u in adj.keys() {
+            if !visited_node.contains(u)
+                && undirected_graph_detect_cycle_bfs(self, &mut visited_node, u)
+            {
+                return true;
+            }
+        }
+        false
+    }
+}
+
+// Helper function to detect cycle in a directed graph using DFS graph traversal
+fn directed_graph_detect_cycle_dfs<'a>(
+    graph: &'a DirectedGraph,
+    visited_node: &mut HashSet<&'a String>,
+    in_stack_visited_node: &mut HashSet<&'a String>,
+    u: &'a String,
+) -> bool {
+    visited_node.insert(u);
+    in_stack_visited_node.insert(u);
+    for (v, _) in graph.adjacency_table().get(u).unwrap() {
+        if visited_node.contains(v) && in_stack_visited_node.contains(v) {
+            return true;
+        }
+        if !visited_node.contains(v)
+            && directed_graph_detect_cycle_dfs(graph, visited_node, in_stack_visited_node, v)
+        {
+            return true;
+        }
+    }
+    in_stack_visited_node.remove(u);
+    false
+}
+
+impl DetectCycle for DirectedGraph {
+    fn detect_cycle_dfs(&self) -> bool {
+        let mut visited_node = HashSet::<&String>::new();
+        let mut in_stack_visited_node = HashSet::<&String>::new();
+        let adj = self.adjacency_table();
+        for u in adj.keys() {
+            if !visited_node.contains(u)
+                && directed_graph_detect_cycle_dfs(
+                    self,
+                    &mut visited_node,
+                    &mut in_stack_visited_node,
+                    u,
+                )
+            {
+                return true;
+            }
+        }
+        false
+    }
+
+    // detect cycle in a the graph using Kahn's algorithm
+    // https://www.geeksforgeeks.org/detect-cycle-in-a-directed-graph-using-bfs/
+    fn detect_cycle_bfs(&self) -> bool {
+        // Set 0 in-degree for each vertex
+        let mut in_degree: HashMap<&String, usize> =
+            self.adjacency_table().keys().map(|k| (k, 0)).collect();
+
+        // Calculate in-degree for each vertex
+        for u in self.adjacency_table().keys() {
+            for (v, _) in self.adjacency_table().get(u).unwrap() {
+                *in_degree.get_mut(v).unwrap() += 1;
+            }
+        }
+        // Initialize queue with vertex having 0 in-degree
+        let mut queue: VecDeque<&String> = in_degree
+            .iter()
+            .filter(|(_, &degree)| degree == 0)
+            .map(|(&k, _)| k)
+            .collect();
+
+        let mut count = 0;
+        while let Some(u) = queue.pop_front() {
+            count += 1;
+            for (v, _) in self.adjacency_table().get(u).unwrap() {
+                in_degree.entry(v).and_modify(|d| {
+                    *d -= 1;
+                    if *d == 0 {
+                        queue.push_back(v);
+                    }
+                });
+            }
+        }
+
+        // If count of processed vertices is not equal to the number of vertices,
+        // the graph has a cycle
+        count != self.adjacency_table().len()
+    }
+}
+
+#[cfg(test)]
+mod test {
+    use crate::data_structures::{graph::Graph, DirectedGraph, UndirectedGraph};
+
+    use super::DetectCycle;
+
+    #[test]
+    fn test_detect_cycle_in_undirected_graph() {
+        let mut graph_with_cycle = UndirectedGraph::new();
+
+        graph_with_cycle.add_edge(("a", "b", 1));
+        graph_with_cycle.add_edge(("a", "c", 1));
+        graph_with_cycle.add_edge(("b", "c", 1));
+        graph_with_cycle.add_edge(("b", "d", 1));
+        graph_with_cycle.add_edge(("c", "d", 1));
+
+        assert!(graph_with_cycle.detect_cycle_dfs());
+        assert!(graph_with_cycle.detect_cycle_bfs());
+
+        let mut graph_without_cycle = UndirectedGraph::new();
+
+        graph_without_cycle.add_edge(("a", "b", 1));
+        graph_without_cycle.add_edge(("a", "c", 1));
+        graph_without_cycle.add_edge(("b", "d", 1));
+        graph_without_cycle.add_edge(("c", "e", 1));
+
+        assert!(!graph_without_cycle.detect_cycle_dfs());
+        assert!(!graph_without_cycle.detect_cycle_bfs());
+    }
+
+    #[test]
+    fn test_detect_cycle_in_directed_graph() {
+        let mut graph_with_cycle = DirectedGraph::new();
+
+        graph_with_cycle.add_edge(("b", "a", 1));
+        graph_with_cycle.add_edge(("c", "a", 1));
+        graph_with_cycle.add_edge(("b", "c", 1));
+        graph_with_cycle.add_edge(("c", "d", 1));
+        graph_with_cycle.add_edge(("d", "b", 1));
+
+        assert!(graph_with_cycle.detect_cycle_dfs());
+        assert!(graph_with_cycle.detect_cycle_bfs());
+
+        let mut graph_without_cycle = DirectedGraph::new();
+
+        graph_without_cycle.add_edge(("b", "a", 1));
+        graph_without_cycle.add_edge(("c", "a", 1));
+        graph_without_cycle.add_edge(("b", "c", 1));
+        graph_without_cycle.add_edge(("c", "d", 1));
+        graph_without_cycle.add_edge(("b", "d", 1));
+
+        assert!(!graph_without_cycle.detect_cycle_dfs());
+        assert!(!graph_without_cycle.detect_cycle_bfs());
+    }
+}

src/graph/mod.rs

@@ -6,6 +6,7 @@ mod centroid_decomposition;
 mod decremental_connectivity;
 mod depth_first_search;
 mod depth_first_search_tic_tac_toe;
+mod detect_cycle;
 mod dijkstra;
 mod dinic_maxflow;
 mod disjoint_set_union;
@@ -33,6 +34,7 @@ pub use self::centroid_decomposition::CentroidDecomposition;
 pub use self::decremental_connectivity::DecrementalConnectivity;
 pub use self::depth_first_search::depth_first_search;
 pub use self::depth_first_search_tic_tac_toe::minimax;
+pub use self::detect_cycle::DetectCycle;
 pub use self::dijkstra::dijkstra;
 pub use self::dinic_maxflow::DinicMaxFlow;
 pub use self::disjoint_set_union::DisjointSetUnion;