adfs.cpp

来自「data struct algorithm and application in」· C++ 代码 · 共 29 行

// test depth first search using adjacency matrix undirected graphs

#include <iostream.h>
#include "ag.h"

void main(void)
{
   AdjacencyGraph G(7);
   int reach[8];
   int n = 7;
   cout << "enter number of edges" << endl;
   int i, e, u, v;
   cin >> e;
   for (i =1; i <= e; i++) {
      cout << "enter edge " << i << endl;
      cin >> u >> v;
      G.Add(u,v);}
   for (i=1; i<=n; i++)
      reach[i] = 0;
   cout << "Doing DFS from vertex 1 labeling 1" << endl;
   G.DFS(1, reach, 1);
   cout << "Doing DFS from vertex 4 labeling 2" << endl;
   G.DFS(4, reach, 2);
   cout << "Vertex labels are" << endl;
   for (i=1; i<=n; i++)
      cout << reach[i] << ' ';
   cout << endl;
}