加权无向图的邻接表存储形式
#include <stdio.h>
#include <stdlib.h>
#define MAX 10
int Visited[MAX];
typedef struct Node {
char data;
int sum;
struct Node* next;
}*GNode;
typedef struct Vertex {
char c;
GNode first;
}*GVertex;
typedef struct Graph {
int n;
int e;
struct Vertex vertex[MAX];
}*MGraph;
void Graphinit(int n, MGraph G);
bool GraphExist(char A, char B, MGraph G);
int GraphEdges(MGraph G);
int GraphVertices(MGraph G);
void GraphAdd(char A, char B,int sum, MGraph G);
void GraphDelete(char A, char B, MGraph G);
int Degree(char A, MGraph G);
void bfs(MGraph G, Vertex V);
int main()
{
MGraph G = (MGraph)malloc(sizeof(struct Graph));
int n;
scanf("%d", &n);
getchar();
Graphinit(n, G);
int sum;
scanf("%d", &sum);
GraphAdd('A', 'B', sum, G);
printf("%d %d\n", GraphEdges(G), GraphVertices(G));
printf("%d\n",