src/work/list_graph.h
changeset 286 d3c4d99860a9
parent 265 bf7aea53635a
child 304 10d035c2e81c
equal deleted inserted replaced
6:f48bcfdfc570 7:a97ad3a9871c
   307     }
   307     }
   308 
   308 
   309     bool valid(Node n) const { return n.valid(); }
   309     bool valid(Node n) const { return n.valid(); }
   310     bool valid(Edge e) const { return e.valid(); }
   310     bool valid(Edge e) const { return e.valid(); }
   311     
   311     
   312     template <typename It> It getNext(It it) const { 
   312 //    template <typename It> It getNext(It it) const { 
   313       It tmp(it); next(tmp); return tmp; }
   313 //      It tmp(it); next(tmp); return tmp; }
   314 //     NodeIt& next(NodeIt& it) const { return ++it; }
   314 //     NodeIt& next(NodeIt& it) const { return ++it; }
   315 //     EdgeIt& next(EdgeIt& it) const { return ++it; }
   315 //     EdgeIt& next(EdgeIt& it) const { return ++it; }
   316 //     OutEdgeIt& next(OutEdgeIt& it) const { return ++it; }
   316 //     OutEdgeIt& next(OutEdgeIt& it) const { return ++it; }
   317 //     InEdgeIt& next(InEdgeIt& it) const { return ++it; }
   317 //     InEdgeIt& next(InEdgeIt& it) const { return ++it; }
   318 //     SymEdgeIt& next(SymEdgeIt& it) const { return ++it; }
   318 //     SymEdgeIt& next(SymEdgeIt& it) const { return ++it; }