加权有向图的邻接矩阵存储形式
#include <stdio.h>
#include <stdlib.h>
#define MAX 10
#define NoEdge 9999999
int Visited[MAX][2];
typedef struct Vertex {
char c;
}*GVertex;
typedef struct Graph {
int n;
int e;
struct Vertex vertex[MAX];
int edges[MAX][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);
int OutDegree(char A, MGraph G);
int InDegree(char A, MGraph G);
void dfs(MGraph G, GVertex V);
int main()
{
MGraph G = (MGraph)malloc(sizeof(struct Graph));
int n;
scanf("%d", &n);
getchar();
Graphinit