COIN-OR::LEMON - Graph Library

Changeset 1754:4bf5ceb49023 in lemon-0.x for lemon/floyd_warshall.h


Ignore:
Timestamp:
11/02/05 16:27:38 (14 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2283
Message:

Documentation modified

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/floyd_warshall.h

    r1741 r1754  
    143143  };
    144144 
    145   /// \brief FloydWarshall algorithm class.
     145  /// \brief %FloydWarshall algorithm class.
    146146  ///
    147147  /// \ingroup flowalgs
    148   /// This class provides an efficient implementation of \c FloydWarshall
     148  /// This class provides an efficient implementation of \c Floyd-Warshall
    149149  /// algorithm. The edge lengths are passed to the algorithm using a
    150150  /// \ref concept::ReadMap "ReadMap", so it is easy to change it to any
     
    153153  /// The algorithm solves the shortest path problem for each pairs
    154154  /// of node when the edges can have negative length but the graph should
    155   /// not contain circle with negative sum of length. If we can assume
     155  /// not contain cycles with negative sum of length. If we can assume
    156156  /// that all edge is non-negative in the graph then the dijkstra algorithm
    157157  /// should be used from each node rather and if the graph is sparse and
    158   /// there are negative circles then the johson algorithm.
     158  /// there are negative circles then the johnson algorithm.
    159159  ///
    160160  /// The complexity of this algorithm is O(n^3 + e).
     
    429429    }
    430430
    431     /// \brief Executes the algorithm and checks the negative circles.
     431    /// \brief Executes the algorithm and checks the negative cycles.
    432432    ///
    433433    /// This method runs the %FloydWarshall algorithm in order to compute
    434     /// the shortest path to each node pairs. If there is a negative circle
     434    /// the shortest path to each node pairs. If there is a negative cycle
    435435    /// in the graph it gives back false.
    436436    /// The algorithm computes
Note: See TracChangeset for help on using the changeset viewer.