Retrieving the graph's adjacency matrix

Question

In graph theory, an adjacency matrix stores ones and zeros to represent edges between nodes. The number of rows and columns represents the number of vertices in the graph. The complexity to check if an edge between two nodes exists with this matrix is O(1) (constant), while the space complexity is O(v^2) with v = number of vertices. This matrix could be very useful when doing graph analysis. Is there any function in AGE that could return a matrix of the graph?

Answer 1

There is no function found in Apache AGE official documentation that could return the Adjacency Matrix of the Graph.

Answer 2

Currently, there doesn't appear to be a function available for retrieving the adjacency matrix of graphs in AGE. While it's not currently supported, implementing such a feature would be highly valuable and beneficial.