Please explain in detail why this is a unweighted, directed, cyclic graph based on the adjacency matrix

Consider a graph having vertices [a, b, c, d, e, f, g]. The edges are defined by this adjacency matrix G. G=[[0,1,1,1,0,0,0],[0,0,0,1,1,0,0][0,0,0,1,0,0,0][0,0,0,0,1,0,1][0,0,0,0,0,0,1][0,0,1,1,0,0,0][0,0,0,0,0,1,0]] What type of graph is this