Added function for getting minimal degree in graph

1 files changed, 13 insertions, 0 deletions

diff --git a/src/main.rs b/src/main.rs
index 5014ec5..e8ad69d 100644
--- a/src/main.rs
+++ b/src/main.rs
@@ -100,6 +100,17 @@ impl Graph {
         return sum;
     }
 
+    fn min_degree(&self) -> usize {
+        let mut min = self.size + 1;
+        for i in 0..self.size {
+            let d = self.degree(i); 
+            if d < min {
+                min = d;
+            }
+        }
+        return min;
+    }
+
     fn get_closure_traced(&self, trace_steps: bool) -> Graph {
         let mut step = if trace_steps { 2 } else { 1 };
 
@@ -289,6 +300,8 @@ fn main() {
         if is_complete {
             let components_count = g.count_components();
             println!("Components count: {components_count}");
+            let min_degree = g.min_degree();
+            println!("Minimal degree: {min_degree}");
             println!("Graph: {line}\n{g}");
 
             println!("Graph cutsets:");