# Changeset 1757:bd4199049036 in lemon-0.x

Ignore:
Timestamp:
11/02/05 17:43:18 (15 years ago)
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2289
Message:

Spellcheck

Location:
lemon
Files:
3 edited

Unmodified
Added
Removed
• ## lemon/floyd_warshall.h

 r1754 /// kind of length. /// /// The algorithm solves the shortest path problem for each pairs /// The algorithm solves the shortest path problem for each pair /// of node when the edges can have negative length but the graph should /// not contain cycles with negative sum of length. If we can assume
• ## lemon/johnson.h

 r1754 /// kind of length. /// /// The algorithm solves the shortest path problem for each pairs /// The algorithm solves the shortest path problem for each pair /// of node when the edges can have negative length but the graph should /// not contain cycles with negative sum of length. If we can assume
• ## lemon/matrix_maps.h

 r1751 /// \brief Container for store values for each ordered pair of graph items /// /// This data structure can strore for each pairs of the same item /// This data structure can strore for each pair of the same item /// type a value. It increase the size of the container when the /// associated graph modified, so it updated automaticly whenever /// \brief Container for store values for each unordered pair of graph items /// /// This data structure can strore for each pairs of the same item /// This data structure can strore for each pair of the same item /// type a value. It increase the size of the container when the /// associated graph modified, so it updated automaticly whenever
Note: See TracChangeset for help on using the changeset viewer.