Changeset 2042:bdc953f2a449 in lemon0.x for lemon/johnson.h
 Timestamp:
 04/07/06 11:54:35 (16 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2681
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/johnson.h
r1993 r2042 192 192 /// should be used from each node. 193 193 /// 194 /// The complexity of this algorithm is $O(n^2 * log(n) + n * log(n) * e)$ or195 /// with fibonacci heap O(n^2 * log(n) + n * e). Usually the fibonacci heap194 /// The complexity of this algorithm is \f$ O(n^2\log(n)+n\log(n)e) \f$ or 195 /// with fibonacci heap \f$ O(n^2\log(n)+ne) \f$. Usually the fibonacci heap 196 196 /// implementation is slower than either binary heap implementation or the 197 197 /// FloydWarshall algorithm.
Note: See TracChangeset
for help on using the changeset viewer.