Merge e6bf296b99 into f3f32ae3ca

updates:
- [github.com/astral-sh/ruff-pre-commit: v0.7.3 → v0.7.4](https://github.com/astral-sh/ruff-pre-commit/compare/v0.7.3...v0.7.4)

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>

.pre-commit-config.yaml

@@ -16,7 +16,7 @@ repos:
       - id: auto-walrus
 
   - repo: https://github.com/astral-sh/ruff-pre-commit
-    rev: v0.7.1
+    rev: v0.7.4
     hooks:
       - id: ruff
       - id: ruff-format
@@ -29,7 +29,7 @@ repos:
           - tomli
 
   - repo: https://github.com/tox-dev/pyproject-fmt
-    rev: "v2.4.3"
+    rev: "v2.5.0"
     hooks:
       - id: pyproject-fmt
 
@@ -42,7 +42,7 @@ repos:
         pass_filenames: false
 
   - repo: https://github.com/abravalheri/validate-pyproject
-    rev: v0.22
+    rev: v0.23
     hooks:
       - id: validate-pyproject
 

data_structures/arrays/sudoku_solver.py

@@ -172,7 +172,7 @@ def solved(values):
 
 def from_file(filename, sep="\n"):
     "Parse a file into a list of strings, separated by sep."
-    return open(filename).read().strip().split(sep)  # noqa: SIM115
+    return open(filename).read().strip().split(sep)
 
 
 def random_puzzle(assignments=17):

graphs/Recommendations for future graphs.

@@ -0,0 +1,11 @@
+#For the future, here are some unique enhancement ideas to expand the algorithms repository.
+
+#Graph Visualization: Integrate tools for visualizing graph algorithms, such as Kahn's algorithm for topological sorting. This would aid users in understanding algorithm behavior in real time. Visuals could include node and edge color changes as the algorithm processes different vertices and edges.
+
+#Algorithm Complexity Documentation: A comprehensive guide on time and space complexity for each algorithm would be beneficial, especially for educational purposes. This would include complexity analysis for various cases (best, average, and worst).
+
+#Adjacency Matrix and List Comparisons: Expand upon graph representations by providing insights into when to use adjacency matrices versus adjacency lists. This could be an educational addition that compares trade-offs in terms of space and time complexity based on graph density and sparsity.
+
+#Edge Cases and Testing: Enhance the testing framework by incorporating edge-case scenarios for algorithms that handle various data structures and data types. For instance, tests could address edge cases in sorting algorithms (like nearly sorted lists or lists with duplicates) and graph algorithms (like disconnected components in Kahn’s algorithm).
+
+#Real-world Applications: Add examples that link algorithms to real-world applications, such as network flow problems or graph-based recommendation systems, to showcase how specific algorithms apply to real scenarios.

scripts/validate_filenames.py

@@ -1,4 +1,4 @@
-#!/usr/bin/env python3
+#!python
 import os
 
 try: