adjacency_matrix: edges -> out_edges

src/entt/graph/adjacency_matrix.hpp

@@ -234,11 +234,11 @@ public:
     }
 
     /**
-     * @brief Returns an iterable object to visit all edges of a vertex.
-     * @param vertex The vertex of which to return all edges.
-     * @return An iterable object to visit all edges of a vertex.
+     * @brief Returns an iterable object to visit all out edges of a vertex.
+     * @param vertex The vertex of which to return all out edges.
+     * @return An iterable object to visit all out edges of a vertex.
      */
-    [[nodiscard]] iterable_adaptor<edge_iterator> edges(const vertex_type vertex) const noexcept {
+    [[nodiscard]] iterable_adaptor<edge_iterator> out_edges(const vertex_type vertex) const noexcept {
         const auto first = vertex * vert;
         const auto last = vertex * vert + vert;
         return {{matrix.data(), vert, first, last}, {matrix.data(), vert, last, last}};

test/entt/graph/adjacency_matrix.cpp

@@ -252,7 +252,7 @@ TEST(AdjacencyMatrix, Edges) {
     ASSERT_EQ(++it, iterable.end());
 }
 
-TEST(AdjacencyMatrix, EdgesByVertex) {
+TEST(AdjacencyMatrix, OutEdges) {
     entt::adjacency_matrix adjacency_matrix{3u};
     auto iterable = adjacency_matrix.edges();
 
@@ -260,7 +260,7 @@ TEST(AdjacencyMatrix, EdgesByVertex) {
 
     adjacency_matrix.insert(0u, 1u);
     adjacency_matrix.insert(1u, 2u);
-    iterable = adjacency_matrix.edges(0u);
+    iterable = adjacency_matrix.out_edges(0u);
 
     ASSERT_NE(iterable.begin(), iterable.end());