klao@225: #include <string>
klao@225: #include <iostream>
klao@225: 
klao@225: #include <path.h>
klao@225: #include <list_graph.h>
klao@225: 
klao@225: using namespace std;
klao@225: using namespace hugo;
klao@225: 
klao@225: bool passed = true;
klao@225: 
klao@225: void check(bool rc) {
klao@225:   passed = passed && rc;
klao@225:   if(!rc) {
klao@225:     cout << "Test failed!" << endl;
klao@225:   }
klao@225: }
klao@225: 
klao@225: int main() {
klao@225: 
klao@225:   typedef ListGraph::Node Node;
klao@225:   typedef ListGraph::Edge Edge;
klao@225: 
klao@225:   ListGraph G;
klao@225: 
klao@225:   Node s=G.addNode();
klao@225:   Node v1=G.addNode();
klao@225:   Node v2=G.addNode();
klao@225:   Node v3=G.addNode();
klao@225:   Node v4=G.addNode();
klao@225:   Node t=G.addNode();
klao@225:   
klao@225:   Edge e1 = G.addEdge(s, v1);
klao@225:   Edge e2 = G.addEdge(s, v2);
klao@225:   Edge e3 = G.addEdge(v1, v2);
klao@225:   Edge e4 = G.addEdge(v2, v1);
klao@225:   Edge e5 = G.addEdge(v1, v3);
klao@225:   Edge e6 = G.addEdge(v3, v2);
klao@225:   Edge e7 = G.addEdge(v2, v4);
klao@225:   Edge e8 = G.addEdge(v4, v3);
klao@225:   Edge e9 = G.addEdge(v3, t);
klao@225:   Edge e10 = G.addEdge(v4, t);
klao@225: 
klao@225:   bool rc;
klao@225: 
klao@369:   {
klao@369:     cout << "DynamicPath tesztelese...\n";
klao@225: 
klao@369:     cout << "Ures path letrehozasa" << endl;
klao@369:     typedef DynamicPath<ListGraph> LPath;
klao@369:     LPath P(G);
klao@225: 
klao@369:     cout << "P.length() == " << P.length() << endl;
klao@369:     check(P.length() == 0);
klao@225: 
klao@369:     cout << "P.from() valid? " << G.valid(P.from()) << endl;
klao@369:     check(! G.valid(P.from()));
klao@225: 
klao@369:     cout << "Hozzaadunk ket elet..." << endl;
klao@369:     check(P.pushBack(e1));
klao@369:     check(P.pushBack(e3));
klao@369:     cout << "P.length() == " << P.length() << endl;
klao@369:     check(P.length() == 2);
klao@369: 
klao@369:     cout << "P.from() valid? " << G.valid(P.from()) << endl;
klao@369:     check(G.valid(P.from()));
klao@225:   
klao@369:     cout << "P.from()==s ? " << (P.from()==s) << endl;
klao@369:     check(P.from() == s);
klao@225: 
klao@369:     cout << "Hozzaadunk egy nem illeszkedo elt." << endl;
klao@369:     rc = P.pushBack(e8);
klao@369:     cout << "Sukerult: " << rc << endl;
klao@369:     check(!rc);
klao@225: 
klao@369:     cout << "Meg 3 el hozzaadasa, nem mind elore iranyu..." << endl;
klao@369:     check(P.pushBack(e6));
klao@369:     check(P.pushBack(e8));
klao@369:     check(P.pushBack(e10));
klao@225: 
klao@369:     cout << "P.length() == " << P.length() << endl;
klao@369:     check(P.length() == 5);
klao@225: 
klao@369:     cout << "P.from()==s ? " << (P.from()==s) << endl;
klao@369:     check(P.from() == s);
klao@369:     cout << "P.to()==t ? " << (P.to()==t) << endl;
klao@369:     check(P.to() == t);
klao@225: 
klao@369:     cout << "Vegpont bellitasa: " << endl;
klao@369:     rc = P.setTo(v2);
klao@369:     cout << "Hibasra: " << rc << endl;
klao@369:     check(!rc);
klao@369:     rc = P.setTo(t);
klao@369:     cout << "Helyesre: " << rc << endl;
klao@369:     check(rc);
klao@225: 
klao@369:     cout << "Elek iranyitasanak ellenorzese." << endl;
klao@369:     cout << "El: " << e1 << ", G.tail(el): " << G.head(e1) << endl;
klao@369:     check(G.tail(e1)==s);
klao@225: 
klao@369:     cout << "Vegigiteralunk az eleken." << endl;
klao@369:     typedef LPath::NodeIt NodeIt;
klao@369:     typedef LPath::EdgeIt EdgeIt;
klao@369:     EdgeIt e = P.first<EdgeIt>();
klao@369:     int i=1;
klao@369:     for(; P.valid(e); P.next(e), ++i) {
klao@369:       cout << i << ". el: " << P.graphEdge(e)
klao@369: 	   << ", elore el? " << P.isForward(e) << endl;
klao@369:       if(i>=3 && i<5) 
klao@369: 	check(!P.isForward(e));
klao@369:       else
klao@369: 	check(P.isForward(e));
klao@369:     }
klao@369: 
klao@369:     {
klao@369:       cout << "Reszut letrehozasa: [2. el, 4. el)..." << endl;
klao@369:       LPath P2(P, P.nth<EdgeIt>(1), P.nth<EdgeIt>(3));
klao@369: 
klao@369:       cout << "P2.length() == " << P2.length() << endl;
klao@369:       check(P2.length() == 2);
klao@369:     
klao@369:       cout << "P2.from()==v1 ? " << (P2.from()==v1) << endl;
klao@369:       check(P2.from() == v1);
klao@369:       cout << "P2.to()==v3 ? " << (P2.to()==v3) << endl;
klao@369:       check(P2.to() == v3);
klao@369:     }
klao@369:     {
klao@369:       cout << "Reszut letrehozasa: [1. el, 6. el)..." << endl;
klao@369:       LPath P2(P, P.nth<EdgeIt>(0), P.nth<EdgeIt>(5));
klao@369: 
klao@369:       cout << "P2.length() == " << P2.length() << endl;
klao@369:       check(P2.length() == 5);
klao@369:     
klao@369:       cout << "P2.from()==s ? " << (P2.from()==s) << endl;
klao@369:       check(P2.from() == s);
klao@369:       cout << "P2.to()==t ? " << (P2.to()==t) << endl;
klao@369:       check(P2.to() == t);
klao@369:     }
klao@369: 
klao@369:     {
klao@369:       cout << "Ket pont altal megadott reszut letrehozasa: [2. pont, 4. pont]..."
klao@369: 	   << endl;
klao@369:       LPath P2(P, P.nth<NodeIt>(1), P.nth<NodeIt>(3));
klao@369: 
klao@369:       cout << "P2.length() == " << P2.length() << endl;
klao@369:       check(P2.length() == 2);
klao@369:     
klao@369:       cout << "P2.from()==v1 ? " << (P2.from()==v1) << endl;
klao@369:       check(P2.from() == v1);
klao@369:       cout << "P2.to()==v3 ? " << (P2.to()==v3) << endl;
klao@369:       check(P2.to() == v3);
klao@369:     }
klao@369:     {
klao@369:       cout << "Egy pontu reszut letrehozasa: [4. pont, 4. pont]..."
klao@369: 	   << endl;
klao@369:       LPath P2(P, P.nth<NodeIt>(3), P.nth<NodeIt>(3));
klao@369: 
klao@369:       cout << "P2.length() == " << P2.length() << endl;
klao@369:       check(P2.length() == 0);
klao@369:     
klao@369:       cout << "P2.from()==v3 ? " << (P2.from()==v3) << endl;
klao@369:       check(P2.from() == v3);
klao@369:       cout << "P2.to()==v3 ? " << (P2.to()==v3) << endl;
klao@369:       check(P2.to() == v3);
klao@369:     }
klao@369:     {
klao@369:       cout << "Forditott ut letrehozasa: [6. pont, 1. pont]..."
klao@369: 	   << endl;
klao@369:       LPath P2(P, P.nth<NodeIt>(5), P.nth<NodeIt>(0));
klao@369: 
klao@369:       cout << "P2.length() == " << P2.length() << endl;
klao@369:       check(P2.length() == 5);
klao@369:     
klao@369:       cout << "P2.from()==t ? " << (P2.from()==t) << endl;
klao@369:       check(P2.from() == t);
klao@369:       cout << "P2.to()==s ? " << (P2.to()==s) << endl;
klao@369:       check(P2.to() == s);
klao@369:     }
klao@369: 
klao@225:   }
klao@225: 
klao@226:   {
klao@369:     cout << "\n\n\nDirPath tesztelese...\n";
klao@226: 
klao@369: 
klao@369:     cout << "Ures path letrehozasa" << endl;
klao@369:     typedef DirPath<ListGraph> DPath;
klao@369:     DPath P(G);
klao@369: 
klao@369:     cout << "P.length() == " << P.length() << endl;
klao@369:     check(P.length() == 0);
klao@369: 
klao@369:     cout << "P.from() valid? " << G.valid(P.from()) << endl;
klao@369:     check(! G.valid(P.from()));
klao@369: 
klao@369:     {
klao@369:       cout << "Builder objektum letrehozasa" << endl;
klao@369:       DPath::Builder B(P);
klao@369: 
klao@369:       cout << "Hozzaadunk az elejehez ket elet..." << endl;
klao@369:       check(B.pushFront(e6));
klao@369:       check(B.pushFront(e5));
klao@369:       cout << "P.length() == " << P.length() << endl;
klao@369:       check(P.length() == 0);
klao@369:       
klao@369:       cout << "Commitolunk..." << endl;
klao@369:       B.commit();
klao@369: 
klao@369:       cout << "P.length() == " << P.length() << endl;
klao@369:       check(P.length() == 2);
klao@369:       cout << "P.from() valid? " << G.valid(P.from()) << endl;
klao@369:       check(G.valid(P.from()));
klao@369:       cout << "P.from()==v1 ? " << (P.from()==v1) << endl;
klao@369:       check(P.from() == v1);
klao@369: 
klao@369:       cout << "Hozzaadunk az elejehez egy nem illeszkedo elet..." << endl;
klao@369:       check(!B.pushFront(e3));
klao@226:     
klao@369:       cout << "Hozzaadunk a vegehez ket elet..." << endl;
klao@369:       check(B.pushBack(e7));
klao@369:       check(B.pushBack(e8));
klao@369:       cout << "P.length() == " << P.length() << endl;
klao@369:       check(P.length() == 4);
klao@369: 
klao@369:       cout << "Hozzaadunk az elejehez meg egy elet..." << endl;
klao@369:       check(B.pushFront(e4));
klao@369:       cout << "P.length() == " << P.length() << endl;
klao@369:       check(P.length() == 4);
klao@369:       
klao@369:       cout << "Es megvarjuk, amig megszunik a Builder...\n";
klao@369:     }
klao@369:     cout << "P.length() == " << P.length() << endl;
klao@369:     check(P.length() == 5);
klao@369:     cout << "P.from()==v2 ? " << (P.from()==v2) << endl;
klao@369:     check(P.from() == v2);
klao@369: 
klao@369:     cout << "Vegigiteralunk az eleken." << endl;
klao@369:     typedef DPath::NodeIt NodeIt;
klao@369:     typedef DPath::EdgeIt EdgeIt;
klao@369:     EdgeIt e;
klao@369:     int i=1;
klao@369:     for(P.first(e); P.valid(e); P.next(e), ++i) {
klao@369:       cout << i << ". el: " << e << endl;
klao@369:     }
klao@226:   }
klao@225: 
klao@225:   cout << (passed ? "All tests passed." : "Some of the tests failed!!!")
klao@225:        << endl;
klao@225: 
klao@225:   return passed ? 0 : 1;
klao@225: }