marci@549: // -*- c++ -*- marci@549: #include <iostream> marci@549: #include <fstream> marci@549: #include <list> marci@549: marci@549: #include <hugo/dimacs.h> marci@549: #include <bfs_dfs_misc.h> marci@549: #include <list_graph.h> marci@557: #include <hugo/graph_wrapper.h> marci@549: marci@549: using namespace hugo; marci@549: marci@549: int main() { marci@549: typedef ListGraph Graph; marci@549: Graph g; marci@552: readDimacs(std::cin, g); marci@552: { marci@552: std::list<Graph::Node> l; marci@552: topSort(g, l); marci@552: std::cout << "Leaving order of dfs which is pretopological..." << std::endl; marci@552: for(std::list<Graph::Node>::const_iterator i=l.begin(); i!=l.end(); ++i) { marci@552: std::cout << *i << " "; marci@552: } marci@552: std::cout << std::endl; marci@549: } marci@552: marci@552: { marci@552: typedef RevGraphWrapper<Graph> GW; marci@552: GW gw(g); marci@552: std::list<GW::Node> l; marci@552: topSort(gw, l); marci@552: std::cout << "Same in the revered oriented graph..." << std::endl; marci@552: for(std::list<GW::Node>::const_iterator i=l.begin(); i!=l.end(); ++i) { marci@552: std::cout << *i << " "; marci@552: } marci@552: std::cout << std::endl; marci@552: } marci@549: marci@549: return 0; marci@549: }