equal
  deleted
  inserted
  replaced
  
    
    
   130   | 
   130   | 
   131     ///The type of the map that indicates which nodes are processed.  | 
   131     ///The type of the map that indicates which nodes are processed.  | 
   132   | 
   132   | 
   133     ///The type of the map that indicates which nodes are processed.  | 
   133     ///The type of the map that indicates which nodes are processed.  | 
   134     ///It must conform to the \ref concepts::WriteMap "WriteMap" concept.  | 
   134     ///It must conform to the \ref concepts::WriteMap "WriteMap" concept.  | 
   135     ///By default it is a NullMap.  | 
   135     ///By default, it is a NullMap.  | 
   136     typedef NullMap<typename Digraph::Node,bool> ProcessedMap;  | 
   136     typedef NullMap<typename Digraph::Node,bool> ProcessedMap;  | 
   137     ///Instantiates a \c ProcessedMap.  | 
   137     ///Instantiates a \c ProcessedMap.  | 
   138   | 
   138   | 
   139     ///This function instantiates a \ref ProcessedMap.  | 
   139     ///This function instantiates a \ref ProcessedMap.  | 
   140     ///\param g is the digraph, to which  | 
   140     ///\param g is the digraph, to which  | 
   424     ///reference types with automatic allocation.  | 
   424     ///reference types with automatic allocation.  | 
   425     ///They should have standard constructor interfaces to be able to  | 
   425     ///They should have standard constructor interfaces to be able to  | 
   426     ///automatically created by the algorithm (i.e. the digraph should be  | 
   426     ///automatically created by the algorithm (i.e. the digraph should be  | 
   427     ///passed to the constructor of the cross reference and the cross  | 
   427     ///passed to the constructor of the cross reference and the cross  | 
   428     ///reference should be passed to the constructor of the heap).  | 
   428     ///reference should be passed to the constructor of the heap).  | 
   429     ///However external heap and cross reference objects could also be  | 
   429     ///However, external heap and cross reference objects could also be  | 
   430     ///passed to the algorithm using the \ref heap() function before  | 
   430     ///passed to the algorithm using the \ref heap() function before  | 
   431     ///calling \ref run(Node) "run()" or \ref init().  | 
   431     ///calling \ref run(Node) "run()" or \ref init().  | 
   432     ///\sa SetHeap  | 
   432     ///\sa SetHeap  | 
   433     template <class H, class CR = typename Digraph::template NodeMap<int> >  | 
   433     template <class H, class CR = typename Digraph::template NodeMap<int> >  | 
   434     struct SetStandardHeap  | 
   434     struct SetStandardHeap  | 
   445     /// \brief \ref named-templ-param "Named parameter" for setting  | 
   445     /// \brief \ref named-templ-param "Named parameter" for setting  | 
   446     ///\c OperationTraits type  | 
   446     ///\c OperationTraits type  | 
   447     ///  | 
   447     ///  | 
   448     ///\ref named-templ-param "Named parameter" for setting  | 
   448     ///\ref named-templ-param "Named parameter" for setting  | 
   449     ///\c OperationTraits type.  | 
   449     ///\c OperationTraits type.  | 
   450     /// For more information see \ref DijkstraDefaultOperationTraits.  | 
   450     /// For more information, see \ref DijkstraDefaultOperationTraits.  | 
   451     template <class T>  | 
   451     template <class T>  | 
   452     struct SetOperationTraits  | 
   452     struct SetOperationTraits  | 
   453       : public Dijkstra<Digraph, LengthMap, SetOperationTraitsTraits<T> > { | 
   453       : public Dijkstra<Digraph, LengthMap, SetOperationTraitsTraits<T> > { | 
   454       typedef Dijkstra<Digraph, LengthMap, SetOperationTraitsTraits<T> >  | 
   454       typedef Dijkstra<Digraph, LengthMap, SetOperationTraitsTraits<T> >  | 
   455       Create;  | 
   455       Create;  | 
   994   | 
   994   | 
   995     ///The type of the map that indicates which nodes are processed.  | 
   995     ///The type of the map that indicates which nodes are processed.  | 
   996   | 
   996   | 
   997     ///The type of the map that indicates which nodes are processed.  | 
   997     ///The type of the map that indicates which nodes are processed.  | 
   998     ///It must conform to the \ref concepts::WriteMap "WriteMap" concept.  | 
   998     ///It must conform to the \ref concepts::WriteMap "WriteMap" concept.  | 
   999     ///By default it is a NullMap.  | 
   999     ///By default, it is a NullMap.  | 
  1000     typedef NullMap<typename Digraph::Node,bool> ProcessedMap;  | 
  1000     typedef NullMap<typename Digraph::Node,bool> ProcessedMap;  | 
  1001     ///Instantiates a ProcessedMap.  | 
  1001     ///Instantiates a ProcessedMap.  | 
  1002   | 
  1002   | 
  1003     ///This function instantiates a ProcessedMap.  | 
  1003     ///This function instantiates a ProcessedMap.  | 
  1004     ///\param g is the digraph, to which  | 
  1004     ///\param g is the digraph, to which  |