lemon/smart_graph.h
changeset 2339 c329fe995b40
parent 2338 359f0b71919b
child 2342 4dd3eb348641
equal deleted inserted replaced
36:796c69cc5a83 37:5b753cbcf9ab
   490       edge.id = edges[edge.id].next_out;
   490       edge.id = edges[edge.id].next_out;
   491     }
   491     }
   492 
   492 
   493     void firstIn(Edge &edge, const Node& v) const {
   493     void firstIn(Edge &edge, const Node& v) const {
   494       edge.id = ((nodes[v.id].first_out) ^ 1);
   494       edge.id = ((nodes[v.id].first_out) ^ 1);
   495       if (e.id == -2) e.id = -1;
   495       if (edge.id == -2) edge.id = -1;
   496     }
   496     }
   497     void nextIn(Edge &edge) const {
   497     void nextIn(Edge &edge) const {
   498       edge.id = ((edges[edge.id ^ 1].next_out) ^ 1);
   498       edge.id = ((edges[edge.id ^ 1].next_out) ^ 1);
   499       if (e.id == -2) e.id = -1;
   499       if (edge.id == -2) edge.id = -1;
   500     }
   500     }
   501 
   501 
   502     void firstInc(UEdge &edge, bool& d, const Node& v) const {
   502     void firstInc(UEdge &edge, bool& d, const Node& v) const {
   503       int de = nodes[v.id].first_out;
   503       int de = nodes[v.id].first_out;
   504       edge.id = de / 2;
   504       edge.id = de / 2;