Changeset 1254:c5cd8960df74 in lemon for lemon/bellman_ford.h
- Timestamp:
- 08/06/13 05:38:49 (11 years ago)
- Branch:
- default
- Phase:
- public
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/bellman_ford.h
r1250 r1254 150 150 /// This class provides an efficient implementation of the Bellman-Ford 151 151 /// algorithm. The maximum time complexity of the algorithm is 152 /// <tt>O(n e)</tt>.152 /// <tt>O(nm)</tt>. 153 153 /// 154 154 /// The Bellman-Ford algorithm solves the single-source shortest path
Note: See TracChangeset
for help on using the changeset viewer.