Storage of Graphs~

• Adjacency matrix

#define maxSize 100 // The maximum number of vertices 
typedef struct {
    
	char vex[maxSize];   // The node data type is in  char  For example , Changeable 
	int edges[maxSize][maxSize];    // Adjacency matrix definition , If you have the right figure , take  int  Change it to  float
	int n,e;    // Current of the graph   Number of vertices   and   Number of edges  
}MGraph;

• Adjacency list

typedef struct ArcNode{
    
	int adjvex;   // The position index of the adjacent points in the array 
	struct ArcNode *nextarc;  // Pointer to the next adjacent point 
	int info;   // Information about this side , Such as ： A weight , There is no requirement to write 
}ArcNode;

typedef struct{
    
	char data;   // Vertex data field 
	ArcNode *firstarc;   // A pointer to an adjacent point 
}VNode;

typedef struct{
    
	VNode adjlist [maxSize];  // An array of vertices in a graph 
	int n,e;   // The number of vertices in the graph   and   edge （ Or arc ） Count 
}AGraph;