Changeset 1916:e7d4eb908e87 in lemon-0.x for lemon

Ignore:
Timestamp:
01/27/06 15:32:33 (15 years ago)
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2491
Message:

make public the shiftedStart inorder to compute just n dijkstra

File:
1 edited

Unmodified
Added
Removed
• lemon/johnson.h

 r1875 } protected: public: ///\name Execution control /// The simplest way to execute the algorithm is to use /// one of the member functions called \c run(...). /// \n /// If you need more control on the execution, /// Finally \ref start() will perform the actual path /// computation. ///@{ /// \brief Initializes the internal data structures. /// /// Initializes the internal data structures. void init() { create_maps(); } /// \brief Executes the algorithm with own potential map. /// /// This method runs the %Johnson algorithm in order to compute /// the shortest path to each node pairs. The potential map /// can be given for this algorithm which usually calculated /// by the Bellman-Ford algorithm. If the graph does not have /// negative length edge then this start function can be used /// with constMap(0) parameter to omit the running time of /// the Bellman-Ford. /// The algorithm computes /// - The shortest path tree for each node. /// - The distance between each node pairs. template void shiftedRun(const PotentialMap& potential) { void shiftedStart(const PotentialMap& potential) { typename Graph::template EdgeMap shiftlen(*graph); for (EdgeIt it(*graph);  it != INVALID; ++it) { } public: ///\name Execution control /// The simplest way to execute the algorithm is to use /// one of the member functions called \c run(...). /// \n /// If you need more control on the execution, /// Finally \ref start() will perform the actual path /// computation. ///@{ /// \brief Initializes the internal data structures. /// /// Initializes the internal data structures. void init() { create_maps(); } /// \brief Executes the algorithm. /// bellmanford.start(); shiftedRun(bellmanford.distMap()); shiftedStart(bellmanford.distMap()); } if (!bellmanford.checkedStart()) return false; shiftedRun(bellmanford.distMap()); shiftedStart(bellmanford.distMap()); return true; }
Note: See TracChangeset for help on using the changeset viewer.