We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 565a7ab commit 247368aCopy full SHA for 247368a
library/graphs/functional_graph_processor.hpp
@@ -2,8 +2,8 @@
2
//! https://github.com/Aeren1564/Algorithms/blob/master/Algorithm_Implementations_Cpp/Graph_Theory/Special_Graphs/functional_graph_processor.sublime-snippet
3
//! @code
4
//! // 0 <= a[i] < n
5
-//! auto [t2, cycle] = func_graph(a);
6
-//! auto [cyc_id, cyc_pos] = t2[v].root_of;
+//! auto [t, cycle] = func_graph(a);
+//! auto [cyc_id, cyc_pos] = t[v].root_of;
7
//! int root = cycle[cyc_id][cyc_pos];
8
//! bool is_on_cycle = (v == root);
9
//! @endcode
0 commit comments