We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent d95021d commit b477f6bCopy full SHA for b477f6b
README.md
@@ -21,7 +21,7 @@ challenge.
21
[bit operations](2023/day21/src/bitarray.rs) to simulate the cellular
22
automaton, which allowed me to implement a fast and generalized solution
23
that should work on any input.
24
-* [Day 25 of 2013](2023/day25/src/main.rs): Using
+* [Day 25 of 2023](2023/day25/src/main.rs): Using
25
[Brandes' algorithm](https://doi.org/10.1080/0022250X.2001.9990249) to
26
quickly calculate the betweenness centrality of graph nodes.
27
0 commit comments