Adjacency matrix representation of graphs A graph is a one to many data type. The graph representation methods include adjacency matrix method and cross linked list method. The operations of the figure include Adjacent (G, x, y): judge whether there are edges<x, y>or (x, y) in graph G. Neighbors (G, x): List the edges adjacent to node x in graph G. InsertVertex (G, x): insert vertex x in graph G. DeleteVertex (G, x): deletes vertex x from graph G. AddEdge (G, x, y): If the undirected edge (x, y) or the directed edge<x, y>does not exist, add the edge to the graph G. RemoveEdge (6, x, y): If an undirected edge (x, y) or a directed edge<x, y>exists, the edge is deleted from the graph G. FirstNeighbor (G, x): Find the first adjacent point of vertex x in graph G. If there is one, return the vertex number. If x has no adjacent points or x does not exist in the graph, then - 1 is returned. Adjacency matrix representation is suitable for dense graphs Graph storage mode 1234567 # define MAX_SIZE 10typedef struct Graph {int vexnum;/* Number of nodes */int vertices [MAX_SIZE];/* Node array */