removed duplcated gl group tags

Author: SpectraL519

include/gl/algorithm/core.hpp

@@ -18,7 +18,7 @@ namespace gl::algorithm {
 
 // --- general types ---
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief A tag type used to explicitly indicate the absence of a callback function.
 ///
 /// > [!NOTE] Performance vs. Empty Lambdas
@@ -30,7 +30,7 @@ namespace gl::algorithm {
 /// > and speeds up compilation times.
 struct empty_callback {};
 
-/// @ingroup GL GL-Algorithm GL-Types
+/// @ingroup GL-Algorithm GL-Types
 /// @brief Represents a generic tri-state decision for control flow.
 ///
 /// Used by custom predicates to determine how to proceed with a given item, execution step, or operation.
@@ -78,7 +78,7 @@ struct decision {
     eval value;
 };
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief Tag used to statically dictate whether an algorithm should return a constructed result or execute purely for side effects.
 ///
 /// > [!NOTE] Namespace Availability
@@ -96,7 +96,7 @@ enum class result_discriminator : bool {
 };
 using enum result_discriminator;
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief Resolves to the specified `ResultType` if `Result` is `ret`, otherwise resolves to `void`.
 ///
 /// ### See Also
@@ -105,7 +105,7 @@ using enum result_discriminator;
 template <result_discriminator Result, typename ResultType>
 using result_type = std::conditional_t<Result == algorithm::ret, ResultType, void>;
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief Resolves to the specified `ResultType` if `Result` is `ret`, otherwise resolves to `std::monostate`.
 ///
 /// Useful for returning dummy values from conditionally compiled algorithm branches.
@@ -119,13 +119,13 @@ using non_void_result_type =
 
 // --- traversal types ---
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief Maps a vertex ID to its predecessor's ID in a traversal tree.
 /// @tparam GraphType The type of the graph being traversed.
 template <traits::c_graph GraphType>
 using predecessors_map = std::vector<typename GraphType::id_type>;
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief Represents an active node in a search container (e.g., a BFS queue or DFS stack).
 /// @tparam GraphType The type of the graph being searched.
 template <traits::c_graph GraphType>
@@ -155,7 +155,7 @@ struct search_node {
 
 // --- constants ---
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief Constant representing the absence of a root vertex ID for a specific ID type.
 ///
 /// ### See Also
@@ -165,7 +165,7 @@ struct search_node {
 template <traits::c_id_type IdType>
 inline constexpr IdType no_root_v = invalid_id_v<IdType>;
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief Tag type providing an implicit conversion to the appropriate `no_root_v` for any numeric ID type.
 ///
 /// ### See Also
@@ -185,7 +185,7 @@ struct no_root_t {
     }
 };
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief Global constant representing the absence of a root vertex.
 ///
 /// ### See Also

include/gl/algorithm/pathfinding/dijkstra.hpp

@@ -15,7 +15,7 @@
 
 namespace gl::algorithm {
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief A descriptor structure holding the results of a single-source shortest path execution.
 ///
 /// ### Template Parameters
@@ -39,13 +39,13 @@ struct paths_descriptor {
     std::vector<distance_type> distances;
 };
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief An alias for @ref gl::algorithm::paths_descriptor "paths_descriptor" that automatically deduces the appropriate distance type for the graph.
 /// @tparam G The type of the graph.
 template <traits::c_graph G>
 using paths_descriptor_type = paths_descriptor<G, vertex_distance_type<G>>;
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief Factory function to create an initialized paths descriptor sized for the given graph.
 /// @tparam G The type of the graph.
 /// @param graph The graph to size the descriptor against.
@@ -55,7 +55,7 @@ template <traits::c_graph G>
     return paths_descriptor_type<G>{graph.n_vertices()};
 }
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief Internal node structure for Dijkstra's algorithm to snapshot distances and preserve heap invariants.
 ///
 /// This structure is used in the @ref gl::algorithm::dijkstra_shortest_paths "dijkstra_shortest_paths" algorithm
@@ -74,7 +74,7 @@ struct dijkstra_search_node {
         distance; ///< The accumulated distance from the source to this vertex at the time of enqueueing.
 };
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief Computes the shortest paths from a single source vertex to all reachable vertices using Dijkstra's algorithm.
 ///
 /// This algorithm utilizes the generic @ref gl::algorithm::pfs "pfs" template using the dedicated
@@ -203,7 +203,7 @@ template <
     return paths;
 }
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief Reconstructs the sequence of vertices forming a path to a specific target.
 ///
 /// This utility walks backward through a predecessor map, starting from the `vertex_id`

include/gl/algorithm/spanning_tree/prim_mst.hpp

@@ -15,7 +15,7 @@
 
 namespace gl::algorithm {
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief A descriptor structure holding the results of a Minimum Spanning Tree (MST) execution.
 ///
 /// @tparam G The type of the undirected graph. Must satisfy the [**c_undirected_graph**](gl_concepts.md#gl-traits-c-undirected-graph) concept.
@@ -40,7 +40,7 @@ struct mst_descriptor {
     weight_type weight = static_cast<weight_type>(0);
 };
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief Computes the Minimum Spanning Tree (MST) of an undirected graph using Prim's algorithm with an edge-based priority queue.
 ///
 /// This implementation uses a standard binary heap (`std::priority_queue`) to store and sort edges based on their weight.
@@ -133,7 +133,7 @@ template <traits::c_undirected_graph G>
     return mst;
 }
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief Computes the Minimum Spanning Tree (MST) of an undirected graph using Prim's algorithm with a vertex-based array heap.
 ///
 /// This variation maintains a heap of vertex IDs based on their minimum known connection cost.

include/gl/algorithm/templates/bfs.hpp

@@ -15,7 +15,7 @@
 
 namespace gl::algorithm {
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief A highly customizable, generic Breadth-First Search (BFS) algorithm engine.
 ///
 /// This template does not implement a specific algorithm (like finding a shortest path).

include/gl/algorithm/templates/dfs.hpp

@@ -15,7 +15,7 @@
 
 namespace gl::algorithm {
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief A highly customizable, generic iterative Depth-First Search (DFS) algorithm engine.
 ///
 /// This engine provides the strict structural execution of a stack-based Depth-First Search.
@@ -130,7 +130,7 @@ bool dfs(
     return true;
 }
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief A highly customizable, generic recursive Depth-First Search (DFS) algorithm engine.
 ///
 /// This engine mirrors the iterative `dfs` behavior but utilizes the C++ call stack.

include/gl/algorithm/templates/pfs.hpp

@@ -17,7 +17,7 @@
 
 namespace gl::algorithm {
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief A highly customizable, generic Priority-First Search (PFS) algorithm engine.
 ///
 /// This template provides the strict structural execution of a priority queue-based search.

include/gl/algorithm/topology/coloring.hpp

@@ -12,11 +12,11 @@
 
 namespace gl::algorithm {
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief Alias for a container mapping vertex indices to their calculated binary (bipartite) colors.
 using bicoloring_type = std::vector<binary_color>;
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief Attempts to compute a valid bipartite (2-color) coloring for the given graph.
 ///
 /// This algorithm utilizes the generic @ref gl::algorithm::bfs "bfs" template to traverse the graph and
@@ -113,7 +113,7 @@ template <
     return coloring;
 }
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief Convenience wrapper for the @ref gl::algorithm::bipartite_coloring "bipartite_coloring" algorithm to check if a graph is bipartite without extracting the exact coloring map.
 /// @param graph The graph to evaluate.
 /// @return `true` if the graph is bipartite (2-colorable), `false` otherwise.
@@ -123,7 +123,7 @@ template <
     return bipartite_coloring(graph).has_value();
 }
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief Applies a computed range of binary colors to the property payload of each vertex in the graph.
 ///
 /// ### Template Parameters

include/gl/algorithm/topology/topological_sort.hpp

@@ -12,7 +12,7 @@
 
 namespace gl::algorithm {
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief Computes a topological ordering of the vertices in a Directed Acyclic Graph (DAG).
 ///
 /// This implementation relies on Kahn's Algorithm. It utilizes the generic @ref gl::algorithm::bfs "bfs"

include/gl/algorithm/traits.hpp

@@ -13,40 +13,40 @@
 
 namespace gl::traits {
 
-/// @ingroup GL GL-Traits
+/// @ingroup GL-Traits
 /// @brief Concept checking if a given type is the @ref gl::algorithm::empty_callback "empty_callback" tag.
 template <typename F>
 concept c_empty_callback = std::same_as<F, algorithm::empty_callback>;
 
-/// @ingroup GL GL-Traits
+/// @ingroup GL-Traits
 /// @brief Concept checking if a type is callable with specific arguments and returns a specific type.
 /// @tparam F The callable type.
 /// @tparam ReturnType The expected return type.
 /// @tparam Args The parameter types the callable must accept.
 template <typename F, typename ReturnType, typename... Args>
 concept c_callback = std::is_invocable_r_v<ReturnType, F, Args...>;
 
-/// @ingroup GL GL-Traits
+/// @ingroup GL-Traits
 /// @brief Concept allowing either a valid callback or the explicit absence of one through the use of @ref gl::algorithm::empty_callback "empty_callback".
 template <typename F, typename ReturnType, typename... Args>
 concept c_optional_callback = c_empty_callback<F> or c_callback<F, ReturnType, Args...>;
 
-/// @ingroup GL GL-Traits
+/// @ingroup GL-Traits
 /// @brief Concept checking if a type is a boolean predicate callable with specific arguments.
 template <typename F, typename... Args>
 concept c_predicate = std::predicate<F, Args...>;
 
-/// @ingroup GL GL-Traits
+/// @ingroup GL-Traits
 /// @brief Concept allowing either a valid boolean predicate or the explicit absence of one through the use of @ref gl::algorithm::empty_callback "empty_callback".
 template <typename F, typename... Args>
 concept c_optional_predicate = c_empty_callback<F> or c_predicate<F, Args...>;
 
-/// @ingroup GL GL-Traits
+/// @ingroup GL-Traits
 /// @brief Concept checking if a type is a predicate returning a @ref gl::algorithm::decision "decision".
 template <typename F, typename... Args>
 concept c_decision_predicate = std::is_invocable_r_v<algorithm::decision, F, Args...>;
 
-/// @ingroup GL GL-Traits
+/// @ingroup GL-Traits
 /// @brief Concept allowing either a valid decision predicate or the explicit absence of one.
 template <typename F, typename... Args>
 concept c_optional_decision_predicate = c_empty_callback<F> or c_decision_predicate<F, Args...>;

include/gl/algorithm/traversal/breadth_first_search.hpp

@@ -14,7 +14,7 @@
 
 namespace gl::algorithm {
 
-/// @ingroup GL GL-Algorithm
+/// @ingroup GL-Algorithm
 /// @brief Executes a concrete Breadth-First Search (BFS) traversal over the graph.
 ///
 /// This function utilizes the generic @ref gl::algorithm::bfs "bfs" template to perform a standard queue-based traversal.