equal
deleted
inserted
replaced
14 * |
14 * |
15 */ |
15 */ |
16 |
16 |
17 ///\ingroup demos |
17 ///\ingroup demos |
18 ///\file |
18 ///\file |
19 ///\brief Demonstrating LEMON implementation of the Dijkstra algorithm |
19 ///\brief Demonstrating the usage of LEMON's Dijkstra algorithm |
20 /// |
20 /// |
21 /// Dijkstra's algorithm computes shortest paths between two nodes in |
21 /// Dijkstra's algorithm computes shortest paths between two nodes in |
22 /// a graph with edge lengths. Here we only show some of the |
22 /// a graph with edge lengths. Here we only show some of the |
23 /// facilities supplied by our implementation: for the detailed |
23 /// facilities supplied by our implementation: for the detailed |
24 /// documentation of the LEMON Dijkstra class read \ref lemon::Dijkstra "this". |
24 /// documentation of the LEMON Dijkstra class read \ref lemon::Dijkstra "this". |