Fixed docs, change logs, clippy warnings

Author: vigna

algo/CHANGELOG.md

@@ -1,55 +1,55 @@
 # Change Log
 
-## [0.6.0] - 2026-02-10
+## [0.6.0] - 2026-02-17
 
 ### Changed
 
-* Moved to `rand` 0.10.0.
+- Moved to `rand` 0.10.0.
 
 ## [0.5.0] - 2025-11-28
 
 ### Changed
 
-* Switched to the 2024 edition.
+- Switched to the 2024 edition.
 
 ## [0.4.0] - 2025-11-15
 
 ### Changed
 
-* Several methods previously accepting a `&ThreadPool` now
+- Several methods previously accepting a `&ThreadPool` now
   they don't. The user can use the standard rayon global thread pool
   or configure their own and use `ThreadPool::install`.
 
 ## [0.3.0] -
 
 ### Changed
 
-* Visits have been moved to the main WebGraph crate.
+- Visits have been moved to the main WebGraph crate.
 
 ## [0.2.0] - 2025-05-23
 
 ### Changed
 
-* Reviewed constructors of parallel visit to offer default granularity.
+- Reviewed constructors of parallel visit to offer default granularity.
 
-* Moved in Layered Label Propagation.
+- Moved in Layered Label Propagation.
 
-* Revamped ExactSumSweep implementation.
+- Revamped ExactSumSweep implementation.
 
 ## [0.1.1] - 2025-04-01
 
 ### New
 
-* ExactSumSweep algorithm for eccentricities, radius, and diameter.
+- ExactSumSweep algorithm for eccentricities, radius, and diameter.
 
-* Strongly connected components.
+- Strongly connected components.
 
 ### Fixed
 
-* Fixed crate name.
+- Fixed crate name.
 
 ## [0.1.0] - 2025-03-31
 
 ### New
 
-* First release.
+- First release.

algo/README.md

@@ -10,29 +10,32 @@
 Algorithms for the Rust implementation of the [WebGraph framework] for graph
 compression.
 
-This crate provides efficient algorithms for analyzing compressed graphs:
-
 ## Algorithms
 
 ### Graph Structure
-- **Strongly Connected Components** (SCCs): Tarjan's algorithm and variants for
-  computing SCCs in directed graphs
-- **Topological Sorting**: Order vertices of a directed acyclic graph
-- **Acyclicity Testing**: Check if a graph is acyclic
+
+- **Strongly Connected Components** ([SCCs]): [Tarjan's algorithm] and
+  [Kosaraju's algorithm] for computing SCCs in directed graphs;
+  [sequential][symm_seq] and [parallel][symm_par] computation
+  of connected components for symmetric graphs
+- **[Topological Sorting]**: Orders vertices of a directed acyclic graph
+- **[Acyclicity Testing]**: Checks if a graph is acyclic
 
 ### Distance Computation
-- **HyperBall**: Probabilistic algorithm for computing distances, closeness
+
+- **[HyperBall]**: Probabilistic algorithm for computing distances, closeness
   centrality, and other measures using HyperLogLog counters
-- **ExactSumSweep**: Exact computation of eccentricities, radius, and diameter
+- **[ExactSumSweep]**: Exact computation of eccentricities, radius, and
+  diameter
 
 ### Community Detection
-- **Layered Label Propagation** (LLP): Fast community detection algorithm for
+
+- **[Layered Label Propagation]** (LLP): Fast community detection algorithm for
   large graphs
 
 ## CLI Integration
 
-Many algorithms can also be accessed through the `webgraph-cli` command-line
-tool.
+Many algorithms can also be accessed through the [command-line interface].
 
 ## Acknowledgments
 
@@ -43,4 +46,15 @@ opinions expressed are however those of the authors only and do not necessarily
 reflect those of the European Union or the Italian MUR. Neither the European
 Union nor the Italian MUR can be held responsible for them.
 
-[WebGraph framework]: <https://webgraph.di.unimi.it/>
+[SCCs]: https://docs.rs/webgraph-algo/latest/webgraph_algo/sccs/index.html
+[Tarjan's algorithm]: https://docs.rs/webgraph-algo/latest/webgraph_algo/sccs/fn.tarjan.html
+[Kosaraju's algorithm]: https://docs.rs/webgraph-algo/latest/webgraph_algo/sccs/fn.kosaraju.html
+[symm_seq]: https://docs.rs/webgraph-algo/latest/webgraph_algo/sccs/fn.symm_seq.html
+[symm_par]: https://docs.rs/webgraph-algo/latest/webgraph_algo/sccs/fn.symm_par.html
+[Topological Sorting]: https://docs.rs/webgraph-algo/latest/webgraph_algo/fn.top_sort.html
+[Acyclicity Testing]: https://docs.rs/webgraph-algo/latest/webgraph_algo/fn.is_acyclic.html
+[HyperBall]: https://docs.rs/webgraph-algo/latest/webgraph_algo/distances/hyperball/struct.HyperBallBuilder.html
+[ExactSumSweep]: https://docs.rs/webgraph-algo/latest/webgraph_algo/distances/exact_sum_sweep/index.html
+[Layered Label Propagation]: https://docs.rs/webgraph-algo/latest/webgraph_algo/llp/index.html
+[command-line interface]: https://docs.rs/webgraph-cli/latest/index.html
+[WebGraph framework]: https://webgraph.di.unimi.it/

algo/src/distances/exact_sum_sweep/computer.rs

@@ -287,7 +287,7 @@ impl<
     ///
     /// # Arguments
     /// * `pl`: A progress logger.
-    pub fn compute(&mut self, pl: &mut impl ProgressLog) {
+    pub(super) fn compute(&mut self, pl: &mut impl ProgressLog) {
         if self.num_nodes == 0 {
             return;
         }

algo/src/lib.rs

@@ -6,6 +6,15 @@
  */
 
 #![doc = include_str!("../README.md")]
+#![deny(unstable_features)]
+#![deny(trivial_casts)]
+#![deny(unconditional_recursion)]
+#![deny(clippy::empty_loop)]
+#![deny(unreachable_code)]
+#![deny(unreachable_pub)]
+#![deny(unreachable_patterns)]
+#![deny(unused_macro_rules)]
+#![deny(unused_doc_comments)]
 #![allow(clippy::type_complexity)]
 
 #[macro_use]
@@ -22,6 +31,7 @@ pub use top_sort::top_sort;
 pub mod distances;
 pub mod prelude {
     pub use crate::acyclicity::is_acyclic;
+    pub use crate::distances;
     pub use crate::sccs::*;
     pub use crate::top_sort::top_sort;
 }

algo/src/llp/mod.rs

@@ -415,7 +415,7 @@ pub fn combine_labels(work_dir: impl AsRef<Path>) -> Result<Box<[usize]>> {
             let path_str = path_name.to_string_lossy();
             path_str.starts_with("labels_")
                 && path_str.ends_with(".bin")
-                && path.file_type().unwrap().is_file()
+                && path.file_type().is_ok_and(|ft| ft.is_file())
         });
 
     let mut num_nodes = None;

cli/CHANGELOG.md

@@ -1,6 +1,6 @@
 # Change Log
 
-## [0.4.0] - 2026-02-10
+## [0.4.0] - 2026-02-17
 
 ### New
 

cli/README.md

@@ -20,7 +20,7 @@ with compressed graphs. The tool supports:
 - **Running** algorithms (Layered Label Propagation)
 - **Benchmarking** graph operations
 
-Each module correspond to a group of commands, and each command is
+Each module corresponds to a group of commands, and each command is
 implemented as a submodule.
 
 ## Subcommands

cli/src/lib.rs

@@ -7,6 +7,15 @@
  */
 
 #![doc = include_str!("../README.md")]
+#![deny(unstable_features)]
+#![deny(trivial_casts)]
+#![deny(unconditional_recursion)]
+#![deny(clippy::empty_loop)]
+#![deny(unreachable_code)]
+#![deny(unreachable_pub)]
+#![deny(unreachable_patterns)]
+#![deny(unused_macro_rules)]
+#![deny(unused_doc_comments)]
 #![allow(clippy::type_complexity)]
 
 use anyhow::{Context, Result, anyhow, bail, ensure};

webgraph/CHANGELOG.md

@@ -1,6 +1,6 @@
 # Change Log
 
-## [0.6.0] - 2025-02-10
+## [0.6.0] - 2026-02-17
 
 ### New
 

webgraph/README.md

@@ -205,7 +205,7 @@ Union nor the Italian MUR can be held responsible for them.
 [labeling]: <https://docs.rs/webgraph/latest/webgraph/traits/labels/trait.SequentialLabeling.html>
 [iteration]: <https://docs.rs/webgraph/latest/webgraph/traits/labels/trait.SequentialLabeling.html#method.iter>
 [retrieve the successors of a node]: <https://docs.rs/webgraph/latest/webgraph/traits/graph/trait.RandomAccessGraph.html#method.successors>
-[LAW website]: <http://law.di.unimi.it/>
+[LAW web site]: <http://law.di.unimi.it/>
 [Elias–Fano]: <sux::dict::EliasFano>
 [WebGraph framework]: <https://webgraph.di.unimi.it/>
 [ε-serde]: <https://crates.io/crates/epserde/>
@@ -215,5 +215,5 @@ Union nor the Italian MUR can be held responsible for them.
 [`BTreeGraph`]: <https://docs.rs/webgraph/latest/webgraph/graphs/btree_graph/struct.BTreeGraph.html>
 [`LabeledBTreeGraph`]: <https://docs.rs/webgraph/latest/webgraph/graphs/btree_graph/struct.LabeledBTreeGraph.html>
 [Common Crawl web site]: <https://commoncrawl.org/>
-[CLI command `webgraph`]: <https://docs.rs/webgraph-cli/latest/index.html>
+[command-line interface]: <https://docs.rs/webgraph-cli/latest/index.html>
 [`CsrGraph`]: <https://docs.rs/webgraph/latest/webgraph/graphs/csr_graph/struct.CsrGraph.html>