Changes in lemon/karp_mmc.h [1164:f63ba40a60f4:1270:dceba191c00d] in lemon
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/karp_mmc.h
r1164 r1270 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 2003-201 05 * Copyright (C) 2003-2013 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). … … 99 99 /// This class implements Karp's algorithm for finding a directed 100 100 /// cycle of minimum mean cost in a digraph 101 /// \ ref karp78characterization, \refdasdan98minmeancycle.102 /// It runs in time O(n e) and uses space O(n<sup>2</sup>+e).101 /// \cite karp78characterization, \cite dasdan98minmeancycle. 102 /// It runs in time O(nm) and uses space O(n<sup>2</sup>+m). 103 103 /// 104 104 /// \tparam GR The type of the digraph the algorithm runs on. … … 141 141 /// 142 142 /// The path type of the found cycles. 143 /// Using the \ref KarpMmcDefaultTraits "default traits class",143 /// Using the \ref lemon::KarpMmcDefaultTraits "default traits class", 144 144 /// it is \ref lemon::Path "Path<Digraph>". 145 145 typedef typename TR::Path Path; 146 146 147 /// The \ref KarpMmcDefaultTraits "traits class" of the algorithm147 /// The \ref lemon::KarpMmcDefaultTraits "traits class" of the algorithm 148 148 typedef TR Traits; 149 149 … … 271 271 /// 272 272 /// If you don't call this function before calling \ref run() or 273 /// \ref findCycleMean(), it will allocate a local \ref Path "path"274 /// structure. The destuctor deallocates this automatically273 /// \ref findCycleMean(), a local \ref Path "path" structure 274 /// will be allocated. The destuctor deallocates this automatically 275 275 /// allocated object, of course. 276 276 ///
Note: See TracChangeset
for help on using the changeset viewer.