equal
deleted
inserted
replaced
17 */ |
17 */ |
18 |
18 |
19 #ifndef LEMON_BELMANN_FORD_H |
19 #ifndef LEMON_BELMANN_FORD_H |
20 #define LEMON_BELMANN_FORD_H |
20 #define LEMON_BELMANN_FORD_H |
21 |
21 |
22 /// \ingroup flowalgs |
22 /// \ingroup shortest_path |
23 /// \file |
23 /// \file |
24 /// \brief BellmanFord algorithm. |
24 /// \brief BellmanFord algorithm. |
25 /// |
25 /// |
26 |
26 |
27 #include <lemon/list_graph.h> |
27 #include <lemon/list_graph.h> |
142 |
142 |
143 }; |
143 }; |
144 |
144 |
145 /// \brief %BellmanFord algorithm class. |
145 /// \brief %BellmanFord algorithm class. |
146 /// |
146 /// |
147 /// \ingroup flowalgs |
147 /// \ingroup shortest_path |
148 /// This class provides an efficient implementation of \c Bellman-Ford |
148 /// This class provides an efficient implementation of \c Bellman-Ford |
149 /// algorithm. The edge lengths are passed to the algorithm using a |
149 /// algorithm. The edge lengths are passed to the algorithm using a |
150 /// \ref concepts::ReadMap "ReadMap", so it is easy to change it to any |
150 /// \ref concepts::ReadMap "ReadMap", so it is easy to change it to any |
151 /// kind of length. |
151 /// kind of length. |
152 /// |
152 /// |
1020 |
1020 |
1021 }; |
1021 }; |
1022 |
1022 |
1023 /// \brief Function type interface for BellmanFord algorithm. |
1023 /// \brief Function type interface for BellmanFord algorithm. |
1024 /// |
1024 /// |
1025 /// \ingroup flowalgs |
1025 /// \ingroup shortest_path |
1026 /// Function type interface for BellmanFord algorithm. |
1026 /// Function type interface for BellmanFord algorithm. |
1027 /// |
1027 /// |
1028 /// This function also has several \ref named-templ-func-param |
1028 /// This function also has several \ref named-templ-func-param |
1029 /// "named parameters", they are declared as the members of class |
1029 /// "named parameters", they are declared as the members of class |
1030 /// \ref BellmanFordWizard. |
1030 /// \ref BellmanFordWizard. |