equal
deleted
inserted
replaced
380 //with the set of edges which are on shortest paths |
380 //with the set of edges which are on shortest paths |
381 MG F; |
381 MG F; |
382 typename ResGW::template NodeMap<typename MG::Node> |
382 typename ResGW::template NodeMap<typename MG::Node> |
383 res_graph_to_F(res_graph); |
383 res_graph_to_F(res_graph); |
384 { |
384 { |
385 typename ResGW::NodeIt n; |
385 for(typename ResGW::NodeIt n(res_graph); n!=INVALID; ++n) |
386 for(res_graph.first(n); n!=INVALID; ++n) |
|
387 res_graph_to_F.set(n, F.addNode()); |
386 res_graph_to_F.set(n, F.addNode()); |
388 } |
387 } |
389 |
388 |
390 typename MG::Node sF=res_graph_to_F[s]; |
389 typename MG::Node sF=res_graph_to_F[s]; |
391 typename MG::Node tF=res_graph_to_F[t]; |
390 typename MG::Node tF=res_graph_to_F[t]; |