lemon/dijkstra.h
changeset 183 0c6556a8e105
parent 157 2ccc1afc2c52
child 184 716b220697a0
equal deleted inserted replaced
1:027323039669 2:8d8f51cf3c8a
    20 #define LEMON_DIJKSTRA_H
    20 #define LEMON_DIJKSTRA_H
    21 
    21 
    22 ///\ingroup shortest_path
    22 ///\ingroup shortest_path
    23 ///\file
    23 ///\file
    24 ///\brief Dijkstra algorithm.
    24 ///\brief Dijkstra algorithm.
    25 ///
    25 
    26 
    26 #include <lemon/list_graph.h>
    27 #include <lemon/list_digraph.h>
       
    28 #include <lemon/bin_heap.h>
    27 #include <lemon/bin_heap.h>
    29 #include <lemon/bits/path_dump.h>
    28 #include <lemon/bits/path_dump.h>
    30 #include <lemon/bits/invalid.h>
    29 #include <lemon/bits/invalid.h>
    31 #include <lemon/error.h>
    30 #include <lemon/error.h>
    32 #include <lemon/maps.h>
    31 #include <lemon/maps.h>
    33 
       
    34 
    32 
    35 namespace lemon {
    33 namespace lemon {
    36 
    34 
    37   /// \brief Default OperationTraits for the Dijkstra algorithm class.
    35   /// \brief Default OperationTraits for the Dijkstra algorithm class.
    38   ///  
    36   ///