Since the eigen decomposition is specifically a property of the matrix representation of the graph, but other things like shortest path distance between two nod

Since the eigen decomposition is specifically a property of the matrix representation of the graph, but other things like shortest path distance between two nodes are naturally enough computed on graphs formed by objects with pointers, perhaps the correct interface is G.adjacency_matrix().eigenvalues().