equal
deleted
inserted
replaced
17 */ |
17 */ |
18 |
18 |
19 #ifndef LEMON_DIJKSTRA_H |
19 #ifndef LEMON_DIJKSTRA_H |
20 #define LEMON_DIJKSTRA_H |
20 #define LEMON_DIJKSTRA_H |
21 |
21 |
22 ///\ingroup flowalgs |
22 ///\ingroup shortest_path |
23 ///\file |
23 ///\file |
24 ///\brief Dijkstra algorithm. |
24 ///\brief Dijkstra algorithm. |
25 /// |
25 /// |
26 ///\todo dijkstraZero() solution should be revised. |
26 ///\todo dijkstraZero() solution should be revised. |
27 |
27 |
138 } |
138 } |
139 }; |
139 }; |
140 |
140 |
141 ///%Dijkstra algorithm class. |
141 ///%Dijkstra algorithm class. |
142 |
142 |
143 /// \ingroup flowalgs |
143 /// \ingroup shortest_path |
144 ///This class provides an efficient implementation of %Dijkstra algorithm. |
144 ///This class provides an efficient implementation of %Dijkstra algorithm. |
145 ///The edge lengths are passed to the algorithm using a |
145 ///The edge lengths are passed to the algorithm using a |
146 ///\ref concepts::ReadMap "ReadMap", |
146 ///\ref concepts::ReadMap "ReadMap", |
147 ///so it is easy to change it to any kind of length. |
147 ///so it is easy to change it to any kind of length. |
148 /// |
148 /// |
1105 |
1105 |
1106 }; |
1106 }; |
1107 |
1107 |
1108 ///Function type interface for Dijkstra algorithm. |
1108 ///Function type interface for Dijkstra algorithm. |
1109 |
1109 |
1110 /// \ingroup flowalgs |
1110 /// \ingroup shortest_path |
1111 ///Function type interface for Dijkstra algorithm. |
1111 ///Function type interface for Dijkstra algorithm. |
1112 /// |
1112 /// |
1113 ///This function also has several |
1113 ///This function also has several |
1114 ///\ref named-templ-func-param "named parameters", |
1114 ///\ref named-templ-func-param "named parameters", |
1115 ///they are declared as the members of class \ref DijkstraWizard. |
1115 ///they are declared as the members of class \ref DijkstraWizard. |