Skip to content

D3128r4: trim new algorithms list in revision history #128

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
pratzl merged 1 commit into from
Mar 26, 2026
Merged

D3128r4: trim new algorithms list in revision history #128

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
10 changes: 2 additions & 8 deletions D3128_Algorithms/tex/revision.tex
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down
Loading