From 5756e8f71f1c07ada74d0ae521485f45a42ab7fb Mon Sep 17 00:00:00 2001 From: Phil Ratzloff Date: Wed, 25 Mar 2026 23:11:38 -0400 Subject: [PATCH] D3128r4: trim new algorithms list in revision history --- D3128_Algorithms/tex/revision.tex | 10 ++-------- 1 file changed, 2 insertions(+), 8 deletions(-) diff --git a/D3128_Algorithms/tex/revision.tex b/D3128_Algorithms/tex/revision.tex index 7c86b7a..cb89d4a 100644 --- a/D3128_Algorithms/tex/revision.tex +++ b/D3128_Algorithms/tex/revision.tex @@ -71,14 +71,8 @@ \subsection*{\paperno r4} \item Add time and space complexity to every algorithm section. \item New algorithms: \begin{itemize} - \item Clustering: Triangle Counting. - \item Communities: Label Propagation (single-graph and two-graph overloads). - \item Components: Articulation Points, BiConnected Components, Connected - Components, Afforest Connected Components, and Kosaraju Strongly - Connected Components. - \item Maximal Independent Set. - \item Link Analysis: Jaccard Coefficient. - \item Minimum Spanning Tree: Kruskal, Inplace Kruskal, and Prim. + \item Afforest Connected Components. + \item Minimum Spanning Tree: Inplace Kruskal. \end{itemize} \item Replace raw container (range) predecessor and distance parameters with function objects (\tcode{PredecessorFn}, \tcode{DistanceFn}) constrained by new \tcode{predecessor_fn_for} and