awbfs.cpp

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

// test breadth first search on adjacency matrix weighted graphs

#include <iostream.h>
#include <stdlib.h>
#include <math.h>
#include "aw.h"

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