src/work/list_graph.h
changeset 277 044f5898b769
parent 260 fb27d1c7036e
child 279 be43902fadb7
equal deleted inserted replaced
5:9f527c816776 6:f48bcfdfc570
   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); return next(tmp); }
   313       It tmp(it); next(tmp); return tmp; }
   314     template <typename It> It& next(It& it) const { return ++it; }
   314 //     NodeIt& next(NodeIt& it) const { return ++it; }
       
   315 //     EdgeIt& next(EdgeIt& it) const { return ++it; }
       
   316 //     OutEdgeIt& next(OutEdgeIt& it) const { return ++it; }
       
   317 //     InEdgeIt& next(InEdgeIt& it) const { return ++it; }
       
   318 //     SymEdgeIt& next(SymEdgeIt& it) const { return ++it; }
       
   319 //    template <typename It> It& next(It& it) const { return ++it; }
       
   320     template <typename It> It& next(It& it) const { ++it; return it; }
   315    
   321    
   316 
   322 
   317     /* for getting id's of graph objects */
   323     /* for getting id's of graph objects */
   318     /* these are important for the implementation of property vectors */
   324     /* these are important for the implementation of property vectors */
   319 
   325