lemon/bfs.h
changeset 218 0d6511647639
parent 209 765619b7cbb2
child 220 a5d8c039f218
child 244 c30731a37f91
equal deleted inserted replaced
3:30ec9245b163 4:c02f00ff8144
   101     ///
   101     ///
   102     typedef typename Digraph::template NodeMap<int> DistMap;
   102     typedef typename Digraph::template NodeMap<int> DistMap;
   103     ///Instantiates a DistMap.
   103     ///Instantiates a DistMap.
   104 
   104 
   105     ///This function instantiates a \ref DistMap.
   105     ///This function instantiates a \ref DistMap.
   106     ///\param G is the digraph, to which we would like to define the \ref DistMap
   106     ///\param G is the digraph, to which we would like to define
       
   107     ///the \ref DistMap
   107     static DistMap *createDistMap(const GR &G)
   108     static DistMap *createDistMap(const GR &G)
   108     {
   109     {
   109       return new DistMap(G);
   110       return new DistMap(G);
   110     }
   111     }
   111   };
   112   };
   823     ///
   824     ///
   824     typedef NullMap<typename Digraph::Node,int> DistMap;
   825     typedef NullMap<typename Digraph::Node,int> DistMap;
   825     ///Instantiates a DistMap.
   826     ///Instantiates a DistMap.
   826 
   827 
   827     ///This function instantiates a \ref DistMap.
   828     ///This function instantiates a \ref DistMap.
   828     ///\param g is the digraph, to which we would like to define the \ref DistMap
   829     ///\param g is the digraph, to which we would like to define
       
   830     ///the \ref DistMap
   829 #ifdef DOXYGEN
   831 #ifdef DOXYGEN
   830     static DistMap *createDistMap(const GR &g)
   832     static DistMap *createDistMap(const GR &g)
   831 #else
   833 #else
   832     static DistMap *createDistMap(const GR &)
   834     static DistMap *createDistMap(const GR &)
   833 #endif
   835 #endif
  1197   ///
  1199   ///
  1198   /// The %BfsVisit class provides an alternative interface to the Bfs
  1200   /// The %BfsVisit class provides an alternative interface to the Bfs
  1199   /// class. It works with callback mechanism, the BfsVisit object calls
  1201   /// class. It works with callback mechanism, the BfsVisit object calls
  1200   /// on every bfs event the \c Visitor class member functions.
  1202   /// on every bfs event the \c Visitor class member functions.
  1201   ///
  1203   ///
  1202   /// \tparam _Digraph The digraph type the algorithm runs on. The default value is
  1204   /// \tparam _Digraph The digraph type the algorithm runs on.
       
  1205   /// The default value is
  1203   /// \ref ListDigraph. The value of _Digraph is not used directly by Bfs, it
  1206   /// \ref ListDigraph. The value of _Digraph is not used directly by Bfs, it
  1204   /// is only passed to \ref BfsDefaultTraits.
  1207   /// is only passed to \ref BfsDefaultTraits.
  1205   /// \tparam _Visitor The Visitor object for the algorithm. The
  1208   /// \tparam _Visitor The Visitor object for the algorithm. The
  1206   /// \ref BfsVisitor "BfsVisitor<_Digraph>" is an empty Visitor which
  1209   /// \ref BfsVisitor "BfsVisitor<_Digraph>" is an empty Visitor which
  1207   /// does not observe the Bfs events. If you want to observe the bfs
  1210   /// does not observe the Bfs events. If you want to observe the bfs