Changeset 463:88ed40ad0d4f in lemon for lemon/suurballe.h

Ignore:
Timestamp:
01/01/09 00:00:00 (11 years ago)
Branch:
default
Children:
468:75a5df083951, 525:9605e051942f
Phase:
public
Message:

Happy New Year again

• update the copyright headers + run the source unifier
File:
1 edited

Unmodified
Added
Removed
• lemon/suurballe.h

 r444 /* -*- C++ -*- /* -*- mode: C++; indent-tabs-mode: nil; -*- * * This file is a part of LEMON, a generic C++ optimization library * This file is a part of LEMON, a generic C++ optimization library. * * Copyright (C) 2003-2008 * Copyright (C) 2003-2009 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport * (Egervary Research Group on Combinatorial Optimization, EGRES). private: /// \brief Special implementation of the Dijkstra algorithm /// for finding shortest paths in the residual network. // The processed (i.e. permanently labeled) nodes std::vector _proc_nodes; Node _s; Node _t; // The length map const LengthMap &_length; // Arc map of the current flow FlowMap *_flow; /// This function sets the potential map. /// /// The potentials provide the dual solution of the underlying /// The potentials provide the dual solution of the underlying /// minimum cost flow problem. /// for (NodeIt n(_graph); n != INVALID; ++n) (*_potential)[n] = 0; _dijkstra = new ResidualDijkstra( _graph, *_flow, _length, _dijkstra = new ResidualDijkstra( _graph, *_flow, _length, *_potential, _pred, _source, _target ); return _path_num; } /// \brief Compute the paths from the flow. ///
Note: See TracChangeset for help on using the changeset viewer.