LEMON/LEMON-main Changeset - r821:072ec8120958

Repositories » LEMON » LEMON-main

Changeset - r821:072ec8120958

« 820:7ef7a5

822:f90326 »

r821:072ec8120958

Fri, 13 Nov 2009 00:39:28

[Not Reviewed]

0 comments (0 inline)

kpeter (Peter Kovacs)
kpeter@inf.elte.hu

Small bug fixes (#180)

0 2 0

default

2 files changed with 2 insertions and 2 deletions:

lemon/capacity_scaling.h

lemon/cost_scaling.h

↑ Collapse diff ↑

lemon/capacity_scaling.h

Show inline comments

@@ -672,25 +672,25 @@
 		    void potentialMap(PotentialMap &map) const {
 		      for (NodeIt n(_graph); n != INVALID; ++n) {
 		        map.set(n, _pi[_node_id[n]]);
+		      }
+		    }
 		    /// @}
 		  private:
 		    // Initialize the algorithm
 		    ProblemType init() {
-		      if (_node_num == 0) return INFEASIBLE;
+		      if (_node_num <= 1) return INFEASIBLE;
 		      // Check the sum of supply values
 		      _sum_supply = 0;
 		      for (int i = 0; i != _root; ++i) {
 		        _sum_supply += _supply[i];
+		      }
 		      if (_sum_supply > 0) return INFEASIBLE;
 		      // Initialize vectors
 		      for (int i = 0; i != _root; ++i) {
 		        _pi[i] = 0;
 		        _excess[i] = _supply[i];

lemon/cost_scaling.h

Show inline comments

@@ -703,25 +703,25 @@
 		    void potentialMap(PotentialMap &map) const {
 		      for (NodeIt n(_graph); n != INVALID; ++n) {
 		        map.set(n, static_cast<Cost>(_pi[_node_id[n]]));
+		      }
+		    }
 		    /// @}
 		  private:
 		    // Initialize the algorithm
 		    ProblemType init() {
-		      if (_res_node_num == 0) return INFEASIBLE;
+		      if (_res_node_num <= 1) return INFEASIBLE;
 		      // Check the sum of supply values
 		      _sum_supply = 0;
 		      for (int i = 0; i != _root; ++i) {
 		        _sum_supply += _supply[i];
+		      }
 		      if (_sum_supply > 0) return INFEASIBLE;
 		      // Initialize vectors
 		      for (int i = 0; i != _res_node_num; ++i) {
 		        _pi[i] = 0;

0 comments (0 inline)

RhodeCode