Changeset 1757:bd4199049036 in lemon-0.x
- Timestamp:
- 11/02/05 17:43:18 (19 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2289
- Location:
- lemon
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/floyd_warshall.h
r1754 r1757 151 151 /// kind of length. 152 152 /// 153 /// The algorithm solves the shortest path problem for each pair s153 /// The algorithm solves the shortest path problem for each pair 154 154 /// of node when the edges can have negative length but the graph should 155 155 /// not contain cycles with negative sum of length. If we can assume -
lemon/johnson.h
r1754 r1757 184 184 /// kind of length. 185 185 /// 186 /// The algorithm solves the shortest path problem for each pair s186 /// The algorithm solves the shortest path problem for each pair 187 187 /// of node when the edges can have negative length but the graph should 188 188 /// not contain cycles with negative sum of length. If we can assume -
lemon/matrix_maps.h
r1751 r1757 202 202 /// \brief Container for store values for each ordered pair of graph items 203 203 /// 204 /// This data structure can strore for each pair sof the same item204 /// This data structure can strore for each pair of the same item 205 205 /// type a value. It increase the size of the container when the 206 206 /// associated graph modified, so it updated automaticly whenever … … 313 313 /// \brief Container for store values for each unordered pair of graph items 314 314 /// 315 /// This data structure can strore for each pair sof the same item315 /// This data structure can strore for each pair of the same item 316 316 /// type a value. It increase the size of the container when the 317 317 /// associated graph modified, so it updated automaticly whenever
Note: See TracChangeset
for help on using the changeset viewer.