Changeset 1143:4fb22cfa5759 in lemon-0.x for src/work/marci/lp/max_flow_expression.cc

Timestamp:

02/08/05 18:47:19 (19 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1542

Message:

The pair of setSomeThing function is getSomeThing.

File:

• src/work/marci/lp/max_flow_expression.cc (modified) (3 diffs)

src/work/marci/lp/max_flow_expression.cc

@@ -3 +3 @@
 #include <fstream>
 
+#include <lemon/graph_utils.h>
 #include <lemon/smart_graph.h>
 #include <lemon/list_graph.h>
@@ -49 +50 @@
   typedef LPSolver::RowIt RowIt;
   typedef Graph::EdgeMap<ColIt> EdgeIndexMap;
+  typedef Graph::NodeMap<RowIt> NodeIndexMap;
   EdgeIndexMap edge_index_map(g);
+  NodeIndexMap node_index_map(g);
   PrimalMap<Edge, EdgeIndexMap> flow(lp, edge_index_map);
 
@@ -76 +79 @@
     if ((n!=s) && (n!=t)) {
       RowIt row_it=lp.addRow();
+      node_index_map.set(n, row_it);
       lp.setRowCoeffs(row_it, expr);
       lp.setRowLowerBound(row_it, 0.0);
       lp.setRowUpperBound(row_it, 0.0);
+//       cout << expr << endl;
+//       {
+//      LPSolver::Expression expr;
+//      lp.getRowCoeffs(node_index_map[n], expr);       
+//      cout << expr << endl;
+//       }
     }
   }
   lp.solveSimplex();
+//   cout << "num of nodes: " << countNodes(g) << endl;
+//   cout << "num of edges: " << countEdges(g) << endl;
+//   cout << "num of rows: " << lp.rowNum() << endl;
+//   cout << "num of rows: " << lp.int_row_map.size() << endl;
+//   for (int i=0; i<lp.int_row_map.size(); ++i) {
+//     cout << lp.int_row_map[i] << " " << endl;
+//   }
+//   cout << "num of columns: " << lp.colNum() << endl;
+//   cout << "num of columns: " << lp.int_col_map.size() << endl;
+//   for (int i=0; i<lp.int_col_map.size(); ++i) {
+//     cout << lp.int_col_map[i] << " " << endl;
+//   }
   cout << "elapsed time: " << ts << endl;
+//   Graph::NodeIt n(g);
+//   ++n;
+//   for(Graph::OutEdgeIt e(g, n); e!=INVALID; ++e) {
+//     cout << edge_index_map[e] << endl;
+//   }
+//   for(Graph::InEdgeIt e(g, n); e!=INVALID; ++e) {
+//     cout << edge_index_map[e] << endl;
+//   }
+//   LPSolver::DualExpression expr;
+//   lp.getRowCoeffs(node_index_map[n], expr);
+//   cout << expr << endl;
 }