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)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1542
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/work/marci/lp/max_flow_expression.cc
r1111 r1143 3 3 #include <fstream> 4 4 5 #include <lemon/graph_utils.h> 5 6 #include <lemon/smart_graph.h> 6 7 #include <lemon/list_graph.h> … … 49 50 typedef LPSolver::RowIt RowIt; 50 51 typedef Graph::EdgeMap<ColIt> EdgeIndexMap; 52 typedef Graph::NodeMap<RowIt> NodeIndexMap; 51 53 EdgeIndexMap edge_index_map(g); 54 NodeIndexMap node_index_map(g); 52 55 PrimalMap<Edge, EdgeIndexMap> flow(lp, edge_index_map); 53 56 … … 76 79 if ((n!=s) && (n!=t)) { 77 80 RowIt row_it=lp.addRow(); 81 node_index_map.set(n, row_it); 78 82 lp.setRowCoeffs(row_it, expr); 79 83 lp.setRowLowerBound(row_it, 0.0); 80 84 lp.setRowUpperBound(row_it, 0.0); 85 // cout << expr << endl; 86 // { 87 // LPSolver::Expression expr; 88 // lp.getRowCoeffs(node_index_map[n], expr); 89 // cout << expr << endl; 90 // } 81 91 } 82 92 } 83 93 lp.solveSimplex(); 94 // cout << "num of nodes: " << countNodes(g) << endl; 95 // cout << "num of edges: " << countEdges(g) << endl; 96 // cout << "num of rows: " << lp.rowNum() << endl; 97 // cout << "num of rows: " << lp.int_row_map.size() << endl; 98 // for (int i=0; i<lp.int_row_map.size(); ++i) { 99 // cout << lp.int_row_map[i] << " " << endl; 100 // } 101 // cout << "num of columns: " << lp.colNum() << endl; 102 // cout << "num of columns: " << lp.int_col_map.size() << endl; 103 // for (int i=0; i<lp.int_col_map.size(); ++i) { 104 // cout << lp.int_col_map[i] << " " << endl; 105 // } 84 106 cout << "elapsed time: " << ts << endl; 107 // Graph::NodeIt n(g); 108 // ++n; 109 // for(Graph::OutEdgeIt e(g, n); e!=INVALID; ++e) { 110 // cout << edge_index_map[e] << endl; 111 // } 112 // for(Graph::InEdgeIt e(g, n); e!=INVALID; ++e) { 113 // cout << edge_index_map[e] << endl; 114 // } 115 // LPSolver::DualExpression expr; 116 // lp.getRowCoeffs(node_index_map[n], expr); 117 // cout << expr << endl; 85 118 }
Note: See TracChangeset
for help on using the changeset viewer.