lwdbfs.cpp

来自「一本全面剖析C++数据结构算法的书籍」· C++ 代码 · 共 26 行

// bredth first search of linked weighted digraphs

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

void main(void)
{
   LinkedWDigraph<int> G(7);
   int reach[8];
   int i, n = 7;
   cout << "enter number of edges" << endl;
   int e, u, v, w;
   cin >> e;
   for (i =1; i <= e; i++) {
      cout << "enter edge " << i << endl;
      cin >> u >> v >> w;
      G.Add(u,v,w);}
   for (i=1; i<=n; i++) reach[i] = 0;
   G.BFS(1, reach, 1);
   G.BFS(4, reach, 2);
   G.BFS(7, reach, 3);
   for (i=1; i<=n; i++)
      cout << reach[i] << ' ';
   cout << endl;
}