remove double example inits

Author: lrvideckis

library/graphs/dijkstra.hpp

@@ -1,9 +1,5 @@
 #pragma once
 //! @code
-//!   {
-//!     vector<vector<pair<int, ll>>> adj(n);
-//!     auto d = dijkstra(adj, source);
-//!   }
 //!   vector<basic_string<array<int, 2>>> adj(n);
 //!   auto d = dijkstra(adj, source);
 //! @endcode

library/graphs/hopcroft_karp.hpp

@@ -1,14 +1,9 @@
 #pragma once
 //! https://github.com/foreverbell/acm-icpc-cheat-sheet/blob/master/src/graph-algorithm/hopcroft-karp.cpp
 //! @code
-//!   {
-//!     vector<vi> adj(lsz);
-//!     auto [matching_size, to_r, to_l,
-//!       mvc_l, mvc_r] = hopcroft_karp(adj, rsz);
-//!   }
 //!   vector<basic_string<int>> adj(lsz);
 //!   adj[l] += r; // add edge l <-> r
-//!                        // 0<=l<lsz; 0<=r<rsz
+//!                // 0<=l<lsz; 0<=r<rsz
 //!   auto [matching_size, to_r, to_l,
 //!     mvc_l, mvc_r] = hopcroft_karp(adj, rsz);
 //! @endcode

library/graphs/scc.hpp

@@ -1,10 +1,6 @@
 #pragma once
 //! https://github.com/kth-competitive-programming/kactl/blob/main/content/graph/SCC.h
 //! @code
-//!   {
-//!     vector<vi> adj(n);
-//!     auto [num_sccs, scc_id] = sccs(adj);
-//!   }
 //!   vector<basic_string<int>> adj(n);
 //!   auto [num_sccs, scc_id] = sccs(adj);
 //! @endcode

library/graphs/uncommon/block_vertex_tree.hpp

@@ -1,12 +1,6 @@
 #pragma once
 #include "cuts.hpp"
 //! @code
-//!   {
-//!     vector<vector<pii>> adj(n);
-//!     auto [num_bccs, bcc_id, is_cut] = cuts(adj, m);
-//!     auto bvt = block_vertex_tree(adj,
-//!       num_bccs, bcc_id);
-//!   }
 //!   vector<basic_string<array<int, 2>>> adj(n);
 //!   auto [num_bccs, bcc_id, is_cut] = cuts(adj, m);
 //!   auto bvt = block_vertex_tree(adj, num_bccs, bcc_id);

library/graphs/uncommon/bridge_tree.hpp

@@ -1,11 +1,6 @@
 #pragma once
 #include "bridges.hpp"
 //! @code
-//!   {
-//!     vector<vector<pii>> adj(n);
-//!     auto [num_ccs, br_id, is_br] = bridges(adj, m);
-//!     auto bt = bridge_tree(adj, num_ccs, br_id, is_br);
-//!   }
 //!   vector<basic_string<array<int, 2>>> adj(n);
 //!   auto [num_ccs, br_id, is_br] = bridges(adj, m);
 //!   auto bt = bridge_tree(adj, num_ccs, br_id, is_br);

library/graphs/uncommon/bridges.hpp

@@ -1,10 +1,6 @@
 #pragma once
 //! https://cp-algorithms.com/graph/bridge-searching.html
 //! @code
-//!   {
-//!     vector<vector<pii>> adj(n);
-//!     auto [num_ccs, br_id, is_br] = bridges(adj, m);
-//!   }
 //!   vector<basic_string<array<int, 2>>> adj(n);
 //!   rep (i, 0, m) {
 //!     int u, v;

library/graphs/uncommon/complement_graph_ccs.hpp

@@ -1,9 +1,5 @@
 #pragma once
 //! @code
-//!   {
-//!     vector<vi> adj(n);
-//!     vi cc_id = get_complement_graph_ccs(adj);
-//!   }
 //!   vector<basic_string<int>> adj;
 //!   vi cc_id = get_complement_graph_ccs(adj);
 //! @endcode

library/graphs/uncommon/cuts.hpp

@@ -1,10 +1,6 @@
 #pragma once
 //! https://cp-algorithms.com/graph/cutpoints.html
 //! @code
-//!   {
-//!     vector<vector<pii>> adj(n);
-//!     auto [num_bccs, bcc_id, is_cut] = cuts(adj, m);
-//!   }
 //!   vector<basic_string<array<int, 2>>> adj(n);
 //!   rep (i, 0, m) {
 //!     int u, v;

library/trees/centroid_decomp.hpp

@@ -1,11 +1,5 @@
 #pragma once
 //! @code
-//!   {
-//!     vector<vi> adj(n);
-//!     centroid(adj, [&](const auto& adj,
-//!       int cent, int par_cent) {
-//!     });
-//!   }
 //!   vector<basic_string<int>> adj(n);
 //!   centroid(adj, [&](const auto& adj,
 //!     int cent, int par_cent) {});

library/trees/edge_cd.hpp

@@ -4,11 +4,6 @@
 //! https://codeforces.com/blog/entry/142176
 //! https://youtu.be/wDwaMo5xa-k
 //! @code
-//!   {
-//!     vector<vi> adj(n);
-//!     edge_cd(adj, [&](const auto& adj,
-//!       int cent, int m) {});
-//!   }
 //!   vector<basic_string<int>> adj(n);
 //!   edge_cd(adj, [&](const auto& adj, int cent, int m) {
 //!     // subtrees of [0, m) of adj[cent]: 1st edge-set