// SortTest.cpp - wdg - 2008
// one exercising of topological sort
#include "AListDAG.cpp"
#include "GraphAlgorithms.cpp"
#include<iostream>
using namespace std;

int main( ) 
{
    AListDAG d(10);
    d.addEdge(4,0);  d.addEdge(1,8);
    d.addEdge(4,1);  d.addEdge(4,9);
    d.addEdge(2,8);  d.addEdge(6,7);
    d.addEdge(6,4);  d.addEdge(5,4);
    d.addEdge(3,4);  d.addEdge(1,0);
    d.addEdge(0,8);  d.addEdge(7,8);
    d.addEdge(4,8);  d.addEdge(9,1);
    d.addEdge(9,2);  d.addEdge(5,9);
    d.addEdge(3,6);  d.addEdge(1,2);
    cout << d.toString() << endl;
    cout << GraphAlgorithms::topologicalSort(d) << endl;
    cout << "Should be: 3 5 6 4 7 9 1 0 2 8" << endl;
    return 0;
}