awdgph2.cpp

来自「数据结构c++语言描述 Borland C++实现」· C++ 代码 · 共 14 行

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

void main(void)
{
   AdjacencyWDigraph<int> G(1);
   G.Input();
   cout << "The graph has " << G.Edges() << " edges." << endl;
   G.Output();
   cin >> G;
   cout << "The graph has " << G.Edges() << " edges." << endl;
   cout << G << endl;
}