1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/src/work/klao/path_test.cc	Sun Mar 21 16:16:08 2004 +0000
     1.3 @@ -0,0 +1,118 @@
     1.4 +#include <string>
     1.5 +#include <iostream>
     1.6 +
     1.7 +#include <path.h>
     1.8 +#include <list_graph.h>
     1.9 +
    1.10 +using namespace std;
    1.11 +using namespace hugo;
    1.12 +
    1.13 +bool passed = true;
    1.14 +
    1.15 +void check(bool rc) {
    1.16 +  passed = passed && rc;
    1.17 +  if(!rc) {
    1.18 +    cout << "Test failed!" << endl;
    1.19 +  }
    1.20 +}
    1.21 +
    1.22 +int main() {
    1.23 +
    1.24 +  typedef ListGraph::Node Node;
    1.25 +  typedef ListGraph::Edge Edge;
    1.26 +
    1.27 +  ListGraph G;
    1.28 +
    1.29 +  Node s=G.addNode();
    1.30 +  Node v1=G.addNode();
    1.31 +  Node v2=G.addNode();
    1.32 +  Node v3=G.addNode();
    1.33 +  Node v4=G.addNode();
    1.34 +  Node t=G.addNode();
    1.35 +  
    1.36 +  Edge e1 = G.addEdge(s, v1);
    1.37 +  Edge e2 = G.addEdge(s, v2);
    1.38 +  Edge e3 = G.addEdge(v1, v2);
    1.39 +  Edge e4 = G.addEdge(v2, v1);
    1.40 +  Edge e5 = G.addEdge(v1, v3);
    1.41 +  Edge e6 = G.addEdge(v3, v2);
    1.42 +  Edge e7 = G.addEdge(v2, v4);
    1.43 +  Edge e8 = G.addEdge(v4, v3);
    1.44 +  Edge e9 = G.addEdge(v3, t);
    1.45 +  Edge e10 = G.addEdge(v4, t);
    1.46 +
    1.47 +  bool rc;
    1.48 +
    1.49 +  cout << "Ures path letrehozasa" << endl;
    1.50 +  typedef Path<ListGraph> LPath;
    1.51 +  LPath P(G);
    1.52 +
    1.53 +  cout << "P.length() == " << P.length() << endl;
    1.54 +  check(P.length() == 0);
    1.55 +
    1.56 +  cout << "P.from() valid? " << G.valid(P.from()) << endl;
    1.57 +  check(! G.valid(P.from()));
    1.58 +
    1.59 +  cout << "Hozzaadunk ket elet..." << endl;
    1.60 +  check(P.pushBack(e1));
    1.61 +  check(P.pushBack(e3));
    1.62 +  cout << "P.length() == " << P.length() << endl;
    1.63 +  check(P.length() == 2);
    1.64 +
    1.65 +  cout << "P.from() valid? " << G.valid(P.from()) << endl;
    1.66 +  check(G.valid(P.from()));
    1.67 +  
    1.68 +  cout << "P.from()==s ? " << (P.from()==s) << endl;
    1.69 +  check(P.from() == s);
    1.70 +
    1.71 +  cout << "Hozzaadunk egy nem illeszkedo elt." << endl;
    1.72 +  rc = P.pushBack(e8);
    1.73 +  cout << "Sukerult: " << rc << endl;
    1.74 +  check(!rc);
    1.75 +
    1.76 +  cout << "Meg 3 el hozzaadasa, nem mind sorrendben..." << endl;
    1.77 +  check(P.pushBack(e6));
    1.78 +  check(P.pushBack(e8));
    1.79 +  check(P.pushBack(e10));
    1.80 +
    1.81 +  cout << "P.length() == " << P.length() << endl;
    1.82 +  check(P.length() == 5);
    1.83 +
    1.84 +  cout << "P.from()==s ? " << (P.from()==s) << endl;
    1.85 +  check(P.from() == s);
    1.86 +  cout << "P.to()==t ? " << (P.to()==t) << endl;
    1.87 +  check(P.to() == t);
    1.88 +
    1.89 +  cout << "Vegpont bellitasa: " << endl;
    1.90 +  rc = P.setTo(v2);
    1.91 +  cout << "Hibasra: " << rc << endl;
    1.92 +  check(!rc);
    1.93 +  rc = P.setTo(t);
    1.94 +  cout << "Helyesre: " << rc << endl;
    1.95 +  check(rc);
    1.96 +
    1.97 +  cout << "Elek iranyitasanak ellenorzese." << endl;
    1.98 +  cout << "El: " << e1 << ", G.tail(el): " << G.head(e1) << endl;
    1.99 +  check(G.tail(e1)==s);
   1.100 +
   1.101 +  cout << "Vegigiteralunk az eleken." << endl;
   1.102 +  typedef LPath::NodeIt NodeIt;
   1.103 +  typedef LPath::EdgeIt EdgeIt;
   1.104 +  EdgeIt e = P.first<EdgeIt>();
   1.105 +  int i=1;
   1.106 +  for(; P.valid(e); P.next(e), ++i) {
   1.107 +    cout << i << ". el: " << P.graphEdge(e)
   1.108 +	 << ", elore el? " << P.isForward(e) << endl;
   1.109 +    if(i>=3 && i<5) 
   1.110 +      check(!P.isForward(e));
   1.111 +    else
   1.112 +      check(P.isForward(e));
   1.113 +  }
   1.114 +
   1.115 +
   1.116 +
   1.117 +  cout << (passed ? "All tests passed." : "Some of the tests failed!!!")
   1.118 +       << endl;
   1.119 +
   1.120 +  return passed ? 0 : 1;
   1.121 +}