Changeset 463:88ed40ad0d4f in lemon for lemon/suurballe.h
 Timestamp:
 01/01/09 00:00:00 (14 years ago)
 Branch:
 default
 Children:
 468:75a5df083951, 525:9605e051942f
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/suurballe.h
r444 r463 1 /* * C++*1 /* * mode: C++; indenttabsmode: nil; * 2 2 * 3 * This file is a part of LEMON, a generic C++ optimization library 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 2003200 85 * Copyright (C) 20032009 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). … … 77 77 78 78 private: 79 79 80 80 /// \brief Special implementation of the Dijkstra algorithm 81 81 /// for finding shortest paths in the residual network. … … 107 107 // The processed (i.e. permanently labeled) nodes 108 108 std::vector<Node> _proc_nodes; 109 109 110 110 Node _s; 111 111 Node _t; … … 201 201 // The length map 202 202 const LengthMap &_length; 203 203 204 204 // Arc map of the current flow 205 205 FlowMap *_flow; … … 269 269 /// This function sets the potential map. 270 270 /// 271 /// The potentials provide the dual solution of the underlying 271 /// The potentials provide the dual solution of the underlying 272 272 /// minimum cost flow problem. 273 273 /// … … 331 331 for (NodeIt n(_graph); n != INVALID; ++n) (*_potential)[n] = 0; 332 332 333 _dijkstra = new ResidualDijkstra( _graph, *_flow, _length, 333 _dijkstra = new ResidualDijkstra( _graph, *_flow, _length, 334 334 *_potential, _pred, 335 335 _source, _target ); … … 371 371 return _path_num; 372 372 } 373 373 374 374 /// \brief Compute the paths from the flow. 375 375 ///
Note: See TracChangeset
for help on using the changeset viewer.