docs alignment

Author: SpectraL519

docs/concepts_cfg.json

@@ -8,14 +8,14 @@
         "GL": {
             "prefix": "gl::",
             "filename": "gl_concepts.md",
-            "anchor": "gl-traits-concepts-documentation",
+            "anchor": "gl-concepts-documentation",
             "title": "GL Concepts",
             "description": "This page documents the C++20 concepts defined within the GL module of the library."
         },
         "HGL": {
             "prefix": "hgl::",
             "filename": "hgl_concepts.md",
-            "anchor": "hgl-traits-concepts-documentation",
+            "anchor": "hgl-concepts-documentation",
             "title": "HGL Concepts",
             "description": "This page documents the C++20 concepts defined within the HGL module of the library."
         }

docs/groups.dox

@@ -62,7 +62,7 @@
 ///
 /// @section concepts_link Detailed Concept Specifications
 /// For a detailed list of all GL module's concepts and their formal requirements, please refer to
-/// the [GL Concepts Documentation](gl_concepts.md#gl-traits-concepts-documentation) page.
+/// the [GL Concepts Documentation](gl_concepts.md#gl-concepts-documentation) page.
 
 /// @defgroup GL-Types Generic Types
 /// @ingroup GL

include/gl/conversion.hpp

@@ -144,9 +144,14 @@ struct to_impl<impl::matrix_t, impl::flat_matrix_t> {
 
 } // namespace detail
 
+/// @ingroup GL GL-Core
+/// @headerfile gl/conversion.hpp
 /// @brief Converts a graph from one implementation model to another.
-/// @tparam TargetImplTag The desired implementation tag (e.g., gl::impl::flat_list_t)
-/// @tparam Graph The automatically deduced type of the source graph
+/// ### Template Parameters
+/// | Parameter     | Description | Constraints |
+/// | :------------ | :---------- | :---------- |
+/// | TargetImplTag | The implementation tag of the desired target representation (e.g., `gl::impl::flat_list_t`) | [**c_graph_impl_tag**](gl_concepts.md#gl-traits-c-graph-impl-tag) |
+/// | Graph         | The type of the source graph, which will be automatically deduced from the function argument. | [**c_graph**](gl_concepts.md#gl-traits-c-graph) |
 /// @param source The graph to convert. After the operation it will be left in a valid, empty state.
 /// @return A new graph containing the moved data, structured according to TargetImplTag.
 template <traits::c_graph_impl_tag TargetImplTag, traits::c_graph Graph>

include/gl/graph.hpp

@@ -36,57 +36,64 @@ concept c_graph = c_instantiation_of<G, graph>;
 
 /// @ingroup GL GL-Traits
 /// @brief Concept checking if a graph is directed.
+/// @see gl::directed_t "directed_t" : For the directional tag used to specify directed graph configuration.
 template <typename G>
 concept c_directed_graph = c_graph<G> and c_directed_edge<typename G::edge_type>;
 
 /// @ingroup GL GL-Traits
 /// @brief Concept checking if a graph is undirected.
+/// @see gl::undirected_t "undirected_t" : For the directional tag used to specify undirected graph configuration.
 template <typename G>
 concept c_undirected_graph = c_graph<G> and c_undirected_edge<typename G::edge_type>;
 
 /// @ingroup GL GL-Traits
 /// @brief Concept checking if a graph utilizes the standard adjacency list implementation.
+/// @see gl::impl::list_t "list_t" : For the implementation tag used to specify the standard adjacency list representation.
 template <typename G>
 concept c_list_graph = c_graph<G> and std::same_as<typename G::implementation_tag, impl::list_t>;
 
 /// @ingroup GL GL-Traits
 /// @brief Concept checking if a graph utilizes the flattened adjacency list implementation.
+/// @see gl::impl::flat_list_t "flat_list_t" : For the implementation tag used to specify the flattened adjacency list representation.
 template <typename G>
 concept c_flat_list_graph =
     c_graph<G> and std::same_as<typename G::implementation_tag, impl::flat_list_t>;
 
 /// @ingroup GL GL-Traits
 /// @brief Concept checking if a graph utilizes any list-based adjacency implementation.
+/// ### See Also
+/// - @ref gl::impl::list_t "list_t" : For the implementation tag used to specify the standard adjacency list representation.
+/// - @ref gl::impl::flat_list_t "flat_list_t" : For the implementation tag used to specify the flattened adjacency list representation.
 template <typename G>
 concept c_adjacency_list_graph = c_list_graph<G> or c_flat_list_graph<G>;
 
 /// @ingroup GL GL-Traits
 /// @brief Concept checking if a graph utilizes the standard adjacency matrix implementation.
+/// @see gl::impl::matrix_t "matrix_t" : For the implementation tag used to specify the standard adjacency matrix representation.
 template <typename G>
 concept c_matrix_graph =
     c_graph<G> and std::same_as<typename G::implementation_tag, impl::matrix_t>;
 
+/// @ingroup GL GL-Traits
+/// @brief Concept checking if a graph utilizes the flattened adjacency matrix implementation.
+/// @see gl::impl::flat_matrix_t "flat_matrix_t" : For the implementation tag used to specify the flattened adjacency matrix representation.
+template <typename G>
+concept c_flat_matrix_graph =
+    c_graph<G> and std::same_as<typename G::implementation_tag, impl::flat_matrix_t>;
+
 /// @ingroup GL GL-Traits
 /// @brief Concept checking if a graph utilizes any matrix-based adjacency implementation.
+/// ### See Also
+/// - @ref gl::impl::matrix_t "matrix_t" : For the implementation tag used to specify the standard adjacency matrix representation.
+/// - @ref gl::impl::flat_matrix_t "flat_matrix_t" : For the implementation tag used to specify the flattened adjacency matrix representation.
 template <typename G>
-concept c_adjacency_matrix_graph = c_matrix_graph<G>;
+concept c_adjacency_matrix_graph = c_matrix_graph<G> or c_flat_matrix_graph<G>;
 
 } // namespace traits
 
-/// @ingroup GL GL-Core
-/// @brief Creates a deep copy of the given graph.
-/// @tparam Graph The type of the graph.
-/// @param source The graph instance to clone.
-/// @return A newly constructed graph containing identical vertices and edges.
 template <traits::c_graph Graph>
 [[nodiscard]] Graph clone(const Graph& source);
 
-/// @ingroup GL GL-Core
-/// @brief Converts a graph to a different implementation type defined by `TargetImplTag`.
-/// @tparam TargetImplTag The implementation tag of the desired target representation.
-/// @tparam Graph The type of the source graph.
-/// @param source The source graph to convert.
-/// @return A new graph instance utilizing the target implementation.
 template <traits::c_graph_impl_tag TargetImplTag, traits::c_graph Graph>
 [[nodiscard]] auto to(Graph&& source);
 
@@ -1184,6 +1191,11 @@ class graph final {
 
 // --- general graph utility ---
 
+/// @ingroup GL GL-Core
+/// @brief Creates a deep copy of the given graph.
+/// @tparam Graph The type of the graph.
+/// @param source The graph instance to clone.
+/// @return A newly constructed graph containing identical vertices, edges and properties (if applicable).
 template <traits::c_graph Graph>
 [[nodiscard]] Graph clone(const Graph& source) {
     return Graph(source);