邻接矩阵的创建和输出（发布）

先看图图！！！

参考资料：http://see.xidian.edu.cn/cpp/html/100.html

好了，上源代码：

#include<stdio.h>#define MAX_NUM 20typedef int AdjMatrix[MAX_NUM][MAX_NUM];void createDgraph(AdjMatrix &a,int n){int i,j;for (i=1;i<=n;i++){for (j=1;j<=n;j++){a[i][j]=0;}}printf("\nEdge i->j:");scanf("%d%d",&i,&j);while (i!=j){a[i][j]=1;printf("\nEdge i->j:");scanf("%d%d",&i,&j);}}void printDgraph(AdjMatrix a,int n){int i,j;printf("\nGraph is:\n");for (i=1;i<=n;i++){for (j=1;j<=n;j++){printf("%d ",a[i][j]);}printf("\n");}}int main(){AdjMatrix a;int num;printf("Input Number of Vertex:");scanf("%d",&num);createDgraph(a,num);printDgraph(a,num);        printf("\n");return 0;}