From 0a19410cb83f20fa505f764abf36cbc89222fe74 Mon Sep 17 00:00:00 2001 From: Andrew Guschin Date: Wed, 11 May 2022 11:12:16 +0400 Subject: Added function for getting minimal degree in graph --- src/main.rs | 13 +++++++++++++ 1 file changed, 13 insertions(+) (limited to 'src/main.rs') 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:"); -- cgit v1.2.3