chore: update repo

README.md

@@ -1,4 +1,4 @@
-# Graph Algorithms in Rust
+# Graph Algorithms
 
 A collection of graph algorithms implemented in Rust. This repository aims to provide efficient and easy-to-understand implementations of various graph algorithms for educational purposes and practical use. 
 
@@ -8,6 +8,7 @@ Contributions are welcome to expand the set of algorithms and improve existing i
 
 [![test](https://github.com/slavik-pastushenko/graph-algorithms-rs/actions/workflows/test.yml/badge.svg)](https://github.com/slavik-pastushenko/graph-algorithms-rs/actions/workflows/test.yml)
 [![codecov](https://codecov.io/gh/slavik-pastushenko/graph-algorithms-rs/graph/badge.svg?token=9EL0F6725A)](https://codecov.io/gh/slavik-pastushenko/graph-algorithms-rs)
+[![License](https://img.shields.io/github/license/slavik-pastushenko/graph-algorithms-rs)](https://github.com/slavik-pastushenko/graph-algorithms-rs/blob/main/LICENSE)
 
 ## Algorithms
 

rust-toolchain.toml

@@ -0,0 +1,3 @@
+[toolchain]
+channel = "1.82.0"
+components = ["clippy", "rustfmt"]

src/dijkstra.rs

@@ -7,7 +7,6 @@ use crate::GraphAlgorithm;
 
 /// Dijkstra's Algorithm.
 /// Finds the shortest path from a starting node to all other nodes in a weighted graph.
-/// Docs: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm
 #[derive(Debug)]
 pub struct Dijkstra {
     /// Graph to search.
@@ -148,7 +147,7 @@ impl GraphAlgorithm for Dijkstra {
         }
 
         // Convert the distances to a vector of shortest paths.
-        for (&node, &dist) in distances.iter() {
+        for (node, dist) in distances.into_iter() {
             if node < result.len() {
                 result[node] = dist;
             }

src/lib.rs

@@ -1,12 +1,5 @@
 #![forbid(unsafe_code)]
 
-// A* Algorithm
-// Dijkstra's Algorithm
-// Breadth-First Search (BFS)
-// Depth-First Search (DFS)
-// Bellman-Ford Algorithm
-// Floyd-Warshall Algorithm
-
 mod dijkstra;
 
 /// A trait for graph search algorithms.