lemon/dijkstra.h
changeset 1570 da93692e6537
parent 1516 4aeda8d11d5e
child 1631 e15162d8eca1
equal deleted inserted replaced
1:36987512157a 2:a3df76ba55a9
   106     ///\todo named parameter to set this type, function to read and write.
   106     ///\todo named parameter to set this type, function to read and write.
   107     typedef NullMap<typename Graph::Node,bool> ProcessedMap;
   107     typedef NullMap<typename Graph::Node,bool> ProcessedMap;
   108     ///Instantiates a ProcessedMap.
   108     ///Instantiates a ProcessedMap.
   109  
   109  
   110     ///This function instantiates a \ref ProcessedMap. 
   110     ///This function instantiates a \ref ProcessedMap. 
   111     ///\param G is the graph, to which
   111     ///\param g is the graph, to which
   112     ///we would like to define the \ref ProcessedMap
   112     ///we would like to define the \ref ProcessedMap
       
   113 #ifdef DOXYGEN
       
   114     static ProcessedMap *createProcessedMap(const GR &g)
       
   115 #else
   113     static ProcessedMap *createProcessedMap(const GR &)
   116     static ProcessedMap *createProcessedMap(const GR &)
       
   117 #endif
   114     {
   118     {
   115       return new ProcessedMap();
   119       return new ProcessedMap();
   116     }
   120     }
   117     ///The type of the map that stores the dists of the nodes.
   121     ///The type of the map that stores the dists of the nodes.
   118  
   122  
   661     ///@{
   665     ///@{
   662 
   666 
   663     ///Copies the shortest path to \c t into \c p
   667     ///Copies the shortest path to \c t into \c p
   664     
   668     
   665     ///This function copies the shortest path to \c t into \c p.
   669     ///This function copies the shortest path to \c t into \c p.
   666     ///If it \c \t is a source itself or unreachable, then it does not
   670     ///If it \c t is a source itself or unreachable, then it does not
   667     ///alter \c p.
   671     ///alter \c p.
   668     ///\todo Is it the right way to handle unreachable nodes?
   672     ///\todo Is it the right way to handle unreachable nodes?
   669     ///\return Returns \c true if a path to \c t was actually copied to \c p,
   673     ///\return Returns \c true if a path to \c t was actually copied to \c p,
   670     ///\c false otherwise.
   674     ///\c false otherwise.
   671     ///\sa DirPath
   675     ///\sa DirPath
   786     ///
   790     ///
   787     typedef NullMap <typename GR::Node,typename GR::Edge> PredMap;
   791     typedef NullMap <typename GR::Node,typename GR::Edge> PredMap;
   788     ///Instantiates a PredMap.
   792     ///Instantiates a PredMap.
   789  
   793  
   790     ///This function instantiates a \ref PredMap. 
   794     ///This function instantiates a \ref PredMap. 
   791     ///\param G is the graph, to which we would like to define the PredMap.
   795     ///\param g is the graph, to which we would like to define the PredMap.
   792     ///\todo The graph alone may be insufficient for the initialization
   796     ///\todo The graph alone may be insufficient for the initialization
       
   797 #ifdef DOXYGEN
       
   798     static PredMap *createPredMap(const GR &g) 
       
   799 #else
   793     static PredMap *createPredMap(const GR &) 
   800     static PredMap *createPredMap(const GR &) 
       
   801 #endif
   794     {
   802     {
   795       return new PredMap();
   803       return new PredMap();
   796     }
   804     }
   797     ///The type of the map that stores whether a nodes is processed.
   805     ///The type of the map that stores whether a nodes is processed.
   798  
   806  
   804     ///\todo named parameter to set this type, function to read and write.
   812     ///\todo named parameter to set this type, function to read and write.
   805     typedef NullMap<typename Graph::Node,bool> ProcessedMap;
   813     typedef NullMap<typename Graph::Node,bool> ProcessedMap;
   806     ///Instantiates a ProcessedMap.
   814     ///Instantiates a ProcessedMap.
   807  
   815  
   808     ///This function instantiates a \ref ProcessedMap. 
   816     ///This function instantiates a \ref ProcessedMap. 
   809     ///\param G is the graph, to which
   817     ///\param g is the graph, to which
   810     ///we would like to define the \ref ProcessedMap
   818     ///we would like to define the \ref ProcessedMap
       
   819 #ifdef DOXYGEN
       
   820     static ProcessedMap *createProcessedMap(const GR &g)
       
   821 #else
   811     static ProcessedMap *createProcessedMap(const GR &)
   822     static ProcessedMap *createProcessedMap(const GR &)
       
   823 #endif
   812     {
   824     {
   813       return new ProcessedMap();
   825       return new ProcessedMap();
   814     }
   826     }
   815     ///The type of the map that stores the dists of the nodes.
   827     ///The type of the map that stores the dists of the nodes.
   816  
   828  
   819     ///
   831     ///
   820     typedef NullMap<typename Graph::Node,typename LM::Value> DistMap;
   832     typedef NullMap<typename Graph::Node,typename LM::Value> DistMap;
   821     ///Instantiates a DistMap.
   833     ///Instantiates a DistMap.
   822  
   834  
   823     ///This function instantiates a \ref DistMap. 
   835     ///This function instantiates a \ref DistMap. 
   824     ///\param G is the graph, to which we would like to define the \ref DistMap
   836     ///\param g is the graph, to which we would like to define the \ref DistMap
       
   837 #ifdef DOXYGEN
       
   838     static DistMap *createDistMap(const GR &g)
       
   839 #else
   825     static DistMap *createDistMap(const GR &)
   840     static DistMap *createDistMap(const GR &)
       
   841 #endif
   826     {
   842     {
   827       return new DistMap();
   843       return new DistMap();
   828     }
   844     }
   829   };
   845   };
   830   
   846