.
authormarci
Thu, 04 Mar 2004 19:45:06 +0000
changeset 156a34e5a909e97
parent 155 8c6292ec54c6
child 157 ee17030e5f47
.
src/work/marci/graph_wrapper.h
     1.1 --- a/src/work/marci/graph_wrapper.h	Thu Mar 04 19:38:07 2004 +0000
     1.2 +++ b/src/work/marci/graph_wrapper.h	Thu Mar 04 19:45:06 2004 +0000
     1.3 @@ -688,36 +688,3 @@
     1.4  
     1.5  #endif //GRAPH_WRAPPER_H
     1.6  
     1.7 -
     1.8 -//   NodeIt &getFirst(NodeIt &n) { return graph->getFirst(n); }
     1.9 -//   InEdgeIt &getFirst(InEdgeIt &e,const NodeIt &n);
    1.10 -//   { return graph->getFirst(e,n); }
    1.11 -//   OutEdgeIt &getFirst(OutEdgeIt &e,const NodeIt &n);
    1.12 -//   { return graph->getFirst(e,n); }
    1.13 -//   SymEdgeIt &getFirst(SymEdgeIt &e,const NodeIt &n);
    1.14 -//   { return graph->getFirst(e,n); }
    1.15 -//   EachEdgeIt &getFirst(EachEdgeIt &e);
    1.16 -//   { return graph->getFirst(e); }
    1.17 -   
    1.18 -//   NodeIt next(const NodeIt &n);
    1.19 -//   { return graph->next(n); }
    1.20 -//   InEdgeIt next(const InEdgeIt &e);
    1.21 -//   { return graph->next(e); }
    1.22 -//   OutEdgeIt next(const OutEdgeIt &e);
    1.23 -//   { return graph->next(e); }
    1.24 -//   SymEdgeIt next(const SymEdgeIt &e);
    1.25 -//   { return graph->next(e); }
    1.26 -//   EachEdgeIt next(const EachEdgeIt &e);
    1.27 -//   { return graph->next(e); }
    1.28 - 
    1.29 -//   NodeIt &goNext(NodeIt &n);
    1.30 -//   { return graph->goNext(n); }
    1.31 -//   InEdgeIt &goNext(InEdgeIt &e);
    1.32 -//   { return graph->goNext(e); }
    1.33 -//   OutEdgeIt &goNext(OutEdgeIt &e);
    1.34 -//   { return graph->goNext(e); }
    1.35 -//   SymEdgeIt &goNext(SymEdgeIt &e);
    1.36 -//   { return graph->goNext(e); }
    1.37 -//   EachEdgeIt &goNext(EachEdgeIt &e);
    1.38 -//   { return graph->goNext(e); }
    1.39 -