45 |
45 |
46 EdgeIt i; //EdgeIt() {} |
46 EdgeIt i; //EdgeIt() {} |
47 EdgeIt j(INVALID); //EdgeIt(Invalid) {} |
47 EdgeIt j(INVALID); //EdgeIt(Invalid) {} |
48 EdgeIt k(p); //EdgeIt(const Path &_p) {} |
48 EdgeIt k(p); //EdgeIt(const Path &_p) {} |
49 |
49 |
50 //??? operator GraphEdge () const {} |
|
51 |
|
52 //INVALIDra megy a ++???? |
|
53 i=++j; //EdgeIt& operator++() {} |
50 i=++j; //EdgeIt& operator++() {} |
54 b=(i==j); //bool operator==(const EdgeIt& e) const {return true;} |
51 b=(i==j); //bool operator==(const EdgeIt& e) const {return true;} |
55 b=(i!=j); //bool operator!=(const EdgeIt& e) const {return true;} |
52 b=(i!=j); //bool operator!=(const EdgeIt& e) const {return true;} |
56 |
53 |
57 |
54 |
58 NodeIt l; //NodeIt() {} |
55 NodeIt l; //NodeIt() {} |
59 NodeIt m(INVALID); //NodeIt(Invalid) {} |
56 NodeIt m(INVALID); //NodeIt(Invalid) {} |
60 NodeIt n(p); //NodeIt(const Path &_p) {} |
57 NodeIt n(p); //NodeIt(const Path &_p) {} |
61 |
|
62 //operator const GraphNode& () const {} |
|
63 |
58 |
64 l=++m; //NodeIt& operator++() {} |
59 l=++m; //NodeIt& operator++() {} |
65 b=(m==n); //bool operator==(const NodeIt& e) const {} |
60 b=(m==n); //bool operator==(const NodeIt& e) const {} |
66 b=(m!=n); //bool operator!=(const NodeIt& e) const {} |
61 b=(m!=n); //bool operator!=(const NodeIt& e) const {} |
67 |
62 |