// test breadth first search on adjacency matrix weighted digraphs

#include "stdafx.h"
#include <iostream>
#include <cstdlib>
#include <cmath>
#include "awd.h"
using namespace std;

void main(void)
{
   AdjacencyWDigraph<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);
   G.BFS(7, reach, 3);
   for (int i=1; i<=n; i++)
      cout << reach[i] << ' ';
   cout << endl;
}