Make the test and lint workflows faster

Author: habedi

.github/workflows/lint.yml

@@ -24,12 +24,13 @@ jobs:
         uses: actions-rust-lang/setup-rust-toolchain@v1
         with:
           toolchain: stable
+          components: clippy
 
-      - name: Install Dependencies
-        run: |
-          sudo apt-get update
-          sudo apt-get install -y clang curl pkg-config libssl-dev make
-          make install-deps
+      - name: Cache Rust dependencies
+        uses: Swatinem/rust-cache@v2
+
+      - name: Install System Dependencies
+        run: sudo apt-get update && sudo apt-get install -y make
 
       - name: Run Linters
         run: make lint

.github/workflows/tests.yml

@@ -31,11 +31,14 @@ jobs:
         with:
           toolchain: ${{ matrix.rust-version }}
 
-      - name: Install Dependencies
-        run: |
-          sudo apt-get update
-          sudo apt-get install -y make
-          make install-deps
+      - name: Cache Rust dependencies
+        uses: Swatinem/rust-cache@v2
+
+      - name: Install System Dependencies
+        run: sudo apt-get update && sudo apt-get install -y make
+
+      - name: Install Tarpaulin for Coverage
+        run: cargo install cargo-tarpaulin cargo-fmt
 
       - name: Run Tests and Generate Coverage Report
         run: make coverage

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;
             }
         }
     }