Make the test and lint workflows faster

Author: habedi

.github/workflows/lint.yml renamed to .github/workflows/lints.yml

@@ -23,7 +23,7 @@ jobs:
       - name: Set up Rust
         uses: actions-rust-lang/setup-rust-toolchain@v1
         with:
-          toolchain: stable
+          toolchain: '1.86.0' # Pinned to project's MSRV
 
       - name: Install Dependencies
         run: |

.github/workflows/tests.yml

@@ -20,7 +20,7 @@ jobs:
     strategy:
       matrix:
         # Define the Rust versions to test against
-        rust-version: [ "1.86.0", "1.87.0", "stable", "beta" ]
+        rust-version: [ "1.86.0", "stable" ]
 
     steps:
       - name: Checkout Repository

src/core/mst.rs

@@ -106,6 +106,7 @@ pub struct MstEdge<W> {
 /// A `Result` containing a tuple with:
 /// - A vector of MST edges (`MstEdge<W>`).
 /// - The total weight of the MST.
+///
 /// Returns an `Err(GraphinaException)` if the input graph is empty.
 ///
 /// # Example
@@ -205,6 +206,7 @@ where
 /// A `Result` containing a tuple with:
 /// - A vector of MST edges (`MstEdge<W>`).
 /// - The total weight of the MST.
+///
 /// Returns an `Err(GraphinaException)` if the input graph is empty.
 ///
 /// # Example
@@ -276,6 +278,7 @@ where
 /// A `Result` containing a tuple with:
 /// - A vector of MST edges (`MstEdge<W>`).
 /// - The total weight of the MST.
+///
 /// Returns an `Err(GraphinaException)` if the input graph is empty.
 ///
 /// # Example

src/core/paths.rs

@@ -64,6 +64,7 @@ where
 /// A `Result` containing a vector of length equal to the number of nodes, where each element is:
 /// - `Some(cost)` if the node is reachable from the source, or
 /// - `None` if it is unreachable.
+///
 /// Returns an `Err(GraphinaException)` if a negative edge weight is found.
 ///
 /// # Complexity

src/core/traversal.rs

@@ -279,10 +279,10 @@ where
 
     if depth > 0 {
         for neighbor in graph.neighbors(current) {
-            if !visited.contains(&neighbor) {
-                if dls(graph, neighbor, target, depth - 1, visited, path) {
-                    return true;
-                }
+            if !visited.contains(&neighbor)
+                && dls(graph, neighbor, target, depth - 1, visited, path)
+            {
+                return true;
             }
         }
     }