lemon/bellman_ford.h
changeset 1140 f8ec64f78b5f
parent 1130 0759d974de81
equal deleted inserted replaced
15:e440ce3d7e5b 16:0b5c0ac52997
   699     /// find augmenting arcs outgoing from them.
   699     /// find augmenting arcs outgoing from them.
   700     /// It returns a wrapped ActiveIt, which looks
   700     /// It returns a wrapped ActiveIt, which looks
   701     /// like an STL container (by having begin() and end())
   701     /// like an STL container (by having begin() and end())
   702     /// which you can use in range-based for loops, STL algorithms, etc.
   702     /// which you can use in range-based for loops, STL algorithms, etc.
   703     LemonRangeWrapper1<ActiveIt, BellmanFord>
   703     LemonRangeWrapper1<ActiveIt, BellmanFord>
   704         activeNodes(const BellmanFord& algorithm) const {
   704     activeNodes() const {
   705       return LemonRangeWrapper1<ActiveIt, BellmanFord>(algorithm);
   705       return LemonRangeWrapper1<ActiveIt, BellmanFord>(*this);
   706     }
   706     }
   707 
   707 
   708 
   708 
   709     /// \name Query Functions
   709     /// \name Query Functions
   710     /// The result of the Bellman-Ford algorithm can be obtained using these
   710     /// The result of the Bellman-Ford algorithm can be obtained using these