equal
deleted
inserted
replaced
103 /// |
103 /// |
104 typedef typename Digraph::template NodeMap<int> DistMap; |
104 typedef typename Digraph::template NodeMap<int> DistMap; |
105 ///Instantiates a DistMap. |
105 ///Instantiates a DistMap. |
106 |
106 |
107 ///This function instantiates a \ref DistMap. |
107 ///This function instantiates a \ref DistMap. |
108 ///\param G is the digraph, to which we would like to define the \ref DistMap |
108 ///\param G is the digraph, to which we would like to define |
|
109 ///the \ref DistMap |
109 static DistMap *createDistMap(const GR &G) |
110 static DistMap *createDistMap(const GR &G) |
110 { |
111 { |
111 return new DistMap(G); |
112 return new DistMap(G); |
112 } |
113 } |
113 }; |
114 }; |
806 /// |
807 /// |
807 typedef NullMap<typename Digraph::Node,int> DistMap; |
808 typedef NullMap<typename Digraph::Node,int> DistMap; |
808 ///Instantiates a DistMap. |
809 ///Instantiates a DistMap. |
809 |
810 |
810 ///This function instantiates a \ref DistMap. |
811 ///This function instantiates a \ref DistMap. |
811 ///\param g is the digraph, to which we would like to define the \ref DistMap |
812 ///\param g is the digraph, to which we would like to define |
|
813 ///the \ref DistMap |
812 #ifdef DOXYGEN |
814 #ifdef DOXYGEN |
813 static DistMap *createDistMap(const GR &g) |
815 static DistMap *createDistMap(const GR &g) |
814 #else |
816 #else |
815 static DistMap *createDistMap(const GR &) |
817 static DistMap *createDistMap(const GR &) |
816 #endif |
818 #endif |
1191 /// |
1193 /// |
1192 /// The %DfsVisit class provides an alternative interface to the Dfs |
1194 /// The %DfsVisit class provides an alternative interface to the Dfs |
1193 /// class. It works with callback mechanism, the DfsVisit object calls |
1195 /// class. It works with callback mechanism, the DfsVisit object calls |
1194 /// on every dfs event the \c Visitor class member functions. |
1196 /// on every dfs event the \c Visitor class member functions. |
1195 /// |
1197 /// |
1196 /// \tparam _Digraph The digraph type the algorithm runs on. The default value is |
1198 /// \tparam _Digraph The digraph type the algorithm runs on. |
|
1199 /// The default value is |
1197 /// \ref ListDigraph. The value of _Digraph is not used directly by Dfs, it |
1200 /// \ref ListDigraph. The value of _Digraph is not used directly by Dfs, it |
1198 /// is only passed to \ref DfsDefaultTraits. |
1201 /// is only passed to \ref DfsDefaultTraits. |
1199 /// \tparam _Visitor The Visitor object for the algorithm. The |
1202 /// \tparam _Visitor The Visitor object for the algorithm. The |
1200 /// \ref DfsVisitor "DfsVisitor<_Digraph>" is an empty Visitor which |
1203 /// \ref DfsVisitor "DfsVisitor<_Digraph>" is an empty Visitor which |
1201 /// does not observe the Dfs events. If you want to observe the dfs |
1204 /// does not observe the Dfs events. If you want to observe the dfs |