tu.cpp

来自「数据结构中应用于图的演示源代码。供参考学习」· C++ 代码 · 共 28 行

#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include "tu1.h"
main()
{
  int n;
  Graph *g=(Graph *)malloc(sizeof(Graph));
  char menu;
  printf("请输入顶点个数:\n");
  scanf("%d",&n);
  creatgraph(g,n);
  printf("邻接矩阵如下所示:\n");
  printgraph(g);
  int p;

  printf("1：广度编历 \n");
  printf("2：深度编历 \n");
  printf("3: 退出\n");
loop: 
		  printf("\n"); 
		  scanf("%d",&p);
  switch(p){
  case 1:BESTraverse(g);break;
  case 2:BESTraverse(g);break;
  case 3:exit(1);break;
  }
  goto loop;}