0
14
0
8
12
8
10
4
4
| ... | ... |
@@ -39,3 +39,3 @@ |
| 39 | 39 |
///Default traits class of Bfs class. |
| 40 |
///\ |
|
| 40 |
///\tparam GR Digraph type. |
|
| 41 | 41 |
template<class GR> |
| ... | ... |
@@ -117,6 +117,6 @@ |
| 117 | 117 |
/// |
| 118 |
///\ |
|
| 118 |
///\tparam GR The digraph type the algorithm runs on. The default value is |
|
| 119 | 119 |
///\ref ListDigraph. The value of GR is not used directly by Bfs, it |
| 120 | 120 |
///is only passed to \ref BfsDefaultTraits. |
| 121 |
///\ |
|
| 121 |
///\tparam TR Traits class to set various data types used by the algorithm. |
|
| 122 | 122 |
///The default traits class is |
| ... | ... |
@@ -125,4 +125,2 @@ |
| 125 | 125 |
///a Bfs traits class. |
| 126 |
/// |
|
| 127 |
///\author Alpar Juttner |
|
| 128 | 126 |
|
| ... | ... |
@@ -758,3 +756,3 @@ |
| 758 | 756 |
///Default traits class of Bfs function. |
| 759 |
///\ |
|
| 757 |
///\tparam GR Digraph type. |
|
| 760 | 758 |
template<class GR> |
| ... | ... |
@@ -1167,3 +1165,3 @@ |
| 1167 | 1165 |
/// Default traits class of BfsVisit class. |
| 1168 |
/// \ |
|
| 1166 |
/// \tparam _Digraph Digraph type. |
|
| 1169 | 1167 |
template<class _Digraph> |
| ... | ... |
@@ -1203,6 +1201,6 @@ |
| 1203 | 1201 |
/// |
| 1204 |
/// \ |
|
| 1202 |
/// \tparam _Digraph The digraph type the algorithm runs on. The default value is |
|
| 1205 | 1203 |
/// \ref ListDigraph. The value of _Digraph is not used directly by Bfs, it |
| 1206 | 1204 |
/// is only passed to \ref BfsDefaultTraits. |
| 1207 |
/// \ |
|
| 1205 |
/// \tparam _Visitor The Visitor object for the algorithm. The |
|
| 1208 | 1206 |
/// \ref BfsVisitor "BfsVisitor<_Digraph>" is an empty Visitor which |
| ... | ... |
@@ -1210,3 +1208,3 @@ |
| 1210 | 1208 |
/// events you should implement your own Visitor class. |
| 1211 |
/// \ |
|
| 1209 |
/// \tparam _Traits Traits class to set various data types used by the |
|
| 1212 | 1210 |
/// algorithm. The default traits class is |
| ... | ... |
@@ -1215,4 +1213,2 @@ |
| 1215 | 1213 |
/// a Bfs visit traits class. |
| 1216 |
/// |
|
| 1217 |
/// \author Jacint Szabo, Alpar Juttner and Balazs Dezso |
|
| 1218 | 1214 |
#ifdef DOXYGEN |
| ... | ... |
@@ -41,6 +41,6 @@ |
| 41 | 41 |
/// |
| 42 |
///\param _Prio Type of the priority of the items. |
|
| 43 |
///\param _ItemIntMap A read and writable Item int map, used internally |
|
| 42 |
///\tparam _Prio Type of the priority of the items. |
|
| 43 |
///\tparam _ItemIntMap A read and writable Item int map, used internally |
|
| 44 | 44 |
///to handle the cross references. |
| 45 |
///\ |
|
| 45 |
///\tparam _Compare A class for the ordering of the priorities. The |
|
| 46 | 46 |
///default is \c std::less<_Prio>. |
| ... | ... |
@@ -46,7 +46,6 @@ |
| 46 | 46 |
/// |
| 47 |
/// \param Notifier The AlterationNotifier that will notify this map. |
|
| 48 |
/// \param Item The item type of the graph items. |
|
| 49 |
/// \param Value The value type of the map. |
|
| 50 |
/// |
|
| 51 |
/// \ |
|
| 47 |
/// \tparam _Notifier The AlterationNotifier that will notify this map. |
|
| 48 |
/// \tparam _Item The item type of the graph items. |
|
| 49 |
/// \tparam _Value The value type of the map. |
|
| 50 |
/// \todo Fix the doc: there is _Graph parameter instead of _Notifier. |
|
| 52 | 51 |
template <typename _Graph, typename _Item, typename _Value> |
| ... | ... |
@@ -42,3 +42,3 @@ |
| 42 | 42 |
/// digraph. |
| 43 |
/// \ |
|
| 43 |
/// \tparam _Digraph The digraph type in which the path is. |
|
| 44 | 44 |
/// |
| ... | ... |
@@ -207,3 +207,3 @@ |
| 207 | 207 |
|
| 208 |
/// \ |
|
| 208 |
/// \tparam _Digraph The digraph type in which the path is. |
|
| 209 | 209 |
/// |
| ... | ... |
@@ -40,3 +40,3 @@ |
| 40 | 40 |
///Default traits class of Dfs class. |
| 41 |
///\ |
|
| 41 |
///\tparam GR Digraph type. |
|
| 42 | 42 |
template<class GR> |
| ... | ... |
@@ -119,6 +119,6 @@ |
| 119 | 119 |
/// |
| 120 |
///\ |
|
| 120 |
///\tparam GR The digraph type the algorithm runs on. The default value is |
|
| 121 | 121 |
///\ref ListDigraph. The value of GR is not used directly by Dfs, it |
| 122 | 122 |
///is only passed to \ref DfsDefaultTraits. |
| 123 |
///\ |
|
| 123 |
///\tparam TR Traits class to set various data types used by the algorithm. |
|
| 124 | 124 |
///The default traits class is |
| ... | ... |
@@ -127,4 +127,2 @@ |
| 127 | 127 |
///a Dfs traits class. |
| 128 |
/// |
|
| 129 |
///\author Jacint Szabo and Alpar Juttner |
|
| 130 | 128 |
#ifdef DOXYGEN |
| ... | ... |
@@ -741,3 +739,3 @@ |
| 741 | 739 |
///Default traits class of Dfs function. |
| 742 |
///\ |
|
| 740 |
///\tparam GR Digraph type. |
|
| 743 | 741 |
template<class GR> |
| ... | ... |
@@ -1162,3 +1160,3 @@ |
| 1162 | 1160 |
/// Default traits class of DfsVisit class. |
| 1163 |
/// \ |
|
| 1161 |
/// \tparam _Digraph Digraph type. |
|
| 1164 | 1162 |
template<class _Digraph> |
| ... | ... |
@@ -1197,6 +1195,6 @@ |
| 1197 | 1195 |
/// |
| 1198 |
/// \ |
|
| 1196 |
/// \tparam _Digraph The digraph type the algorithm runs on. The default value is |
|
| 1199 | 1197 |
/// \ref ListDigraph. The value of _Digraph is not used directly by Dfs, it |
| 1200 | 1198 |
/// is only passed to \ref DfsDefaultTraits. |
| 1201 |
/// \ |
|
| 1199 |
/// \tparam _Visitor The Visitor object for the algorithm. The |
|
| 1202 | 1200 |
/// \ref DfsVisitor "DfsVisitor<_Digraph>" is an empty Visitor which |
| ... | ... |
@@ -1204,3 +1202,3 @@ |
| 1204 | 1202 |
/// events you should implement your own Visitor class. |
| 1205 |
/// \ |
|
| 1203 |
/// \tparam _Traits Traits class to set various data types used by the |
|
| 1206 | 1204 |
/// algorithm. The default traits class is |
| ... | ... |
@@ -79,4 +79,4 @@ |
| 79 | 79 |
///Default traits class of Dijkstra class. |
| 80 |
///\param GR Digraph type. |
|
| 81 |
///\param LM Type of length map. |
|
| 80 |
///\tparam GR Digraph type. |
|
| 81 |
///\tparam LM Type of length map. |
|
| 82 | 82 |
template<class GR, class LM> |
| ... | ... |
@@ -196,6 +196,6 @@ |
| 196 | 196 |
/// |
| 197 |
///\ |
|
| 197 |
///\tparam GR The digraph type the algorithm runs on. The default value |
|
| 198 | 198 |
///is \ref ListDigraph. The value of GR is not used directly by |
| 199 | 199 |
///Dijkstra, it is only passed to \ref DijkstraDefaultTraits. |
| 200 |
///\ |
|
| 200 |
///\tparam LM This read-only ArcMap determines the lengths of the |
|
| 201 | 201 |
///arcs. It is read once for each arc, so the map may involve in |
| ... | ... |
@@ -205,3 +205,4 @@ |
| 205 | 205 |
///of LM is not used directly by Dijkstra, it is only passed to \ref |
| 206 |
///DijkstraDefaultTraits. |
|
| 206 |
///DijkstraDefaultTraits. |
|
| 207 |
///\tparam TR Traits class to set |
|
| 207 | 208 |
///various data types used by the algorithm. The default traits |
| ... | ... |
@@ -211,4 +212,2 @@ |
| 211 | 212 |
///class. |
| 212 |
/// |
|
| 213 |
///\author Jacint Szabo and Alpar Juttner |
|
| 214 | 213 |
|
| ... | ... |
@@ -877,4 +876,4 @@ |
| 877 | 876 |
///Default traits class of Dijkstra function. |
| 878 |
///\param GR Digraph type. |
|
| 879 |
///\param LM Type of length map. |
|
| 877 |
///\tparam GR Digraph type. |
|
| 878 |
///\tparam LM Type of length map. |
|
| 880 | 879 |
template<class GR, class LM> |
| ... | ... |
@@ -418,3 +418,3 @@ |
| 418 | 418 |
///Sets the map of the arc widths |
| 419 |
///\param x must be |
|
| 419 |
///\param x must be an arc map with \c double (or convertible) values. |
|
| 420 | 420 |
template<class X> GraphToEps<ArcWidthsTraits<X> > arcWidths(const X &x) |
| ... | ... |
@@ -466,3 +466,3 @@ |
| 466 | 466 |
///Sets the map of the arc colors |
| 467 |
///\param x must be |
|
| 467 |
///\param x must be an arc map with \ref Color values. |
|
| 468 | 468 |
/// |
| ... | ... |
@@ -356,4 +356,2 @@ |
| 356 | 356 |
///\sa DynArcLookUp |
| 357 |
/// |
|
| 358 |
/// \author Balazs Dezso |
|
| 359 | 357 |
template <typename _Graph> |
| ... | ... |
@@ -480,4 +478,2 @@ |
| 480 | 478 |
///\sa findEdge() |
| 481 |
/// |
|
| 482 |
/// \author Balazs Dezso |
|
| 483 | 479 |
template <typename _Graph> |
| ... | ... |
@@ -1244,5 +1240,5 @@ |
| 1244 | 1240 |
/// |
| 1245 |
/// \param _Graph The graph type. |
|
| 1246 |
/// \param _Item The item type of the graph. |
|
| 1247 |
/// \ |
|
| 1241 |
/// \tparam _Graph The graph type. |
|
| 1242 |
/// \tparam _Item The item type of the graph. |
|
| 1243 |
/// \tparam _Value The value type of the map. |
|
| 1248 | 1244 |
/// |
| ... | ... |
@@ -1449,4 +1445,4 @@ |
| 1449 | 1445 |
/// |
| 1450 |
/// \param _Graph The graph class the \c DescriptorMap belongs to. |
|
| 1451 |
/// \param _Item The Item is the Key of the Map. It may be Node, Arc or |
|
| 1446 |
/// \tparam _Graph The graph class the \c DescriptorMap belongs to. |
|
| 1447 |
/// \tparam _Item The Item is the Key of the Map. It may be Node, Arc or |
|
| 1452 | 1448 |
/// Edge. |
| ... | ... |
@@ -1639,3 +1635,2 @@ |
| 1639 | 1635 |
/// \see TargetMap |
| 1640 |
/// \author Balazs Dezso |
|
| 1641 | 1636 |
template <typename Digraph> |
| ... | ... |
@@ -1679,3 +1674,2 @@ |
| 1679 | 1674 |
/// \see SourceMap |
| 1680 |
/// \author Balazs Dezso |
|
| 1681 | 1675 |
template <typename Digraph> |
| ... | ... |
@@ -1719,3 +1713,2 @@ |
| 1719 | 1713 |
/// \see BackwardMap |
| 1720 |
/// \author Balazs Dezso |
|
| 1721 | 1714 |
template <typename Graph> |
| ... | ... |
@@ -1759,3 +1752,2 @@ |
| 1759 | 1752 |
/// \see ForwardMap |
| 1760 |
/// \author Balazs Dezso |
|
| 1761 | 1753 |
template <typename Graph> |
| ... | ... |
@@ -2098,3 +2090,3 @@ |
| 2098 | 2090 |
/// |
| 2099 |
///\ |
|
| 2091 |
///\tparam G The type of the underlying digraph. |
|
| 2100 | 2092 |
/// |
| ... | ... |
@@ -2539,3 +2531,3 @@ |
| 2539 | 2531 |
/// |
| 2540 |
///\ |
|
| 2532 |
///\tparam G The type of the underlying digraph. |
|
| 2541 | 2533 |
/// |
| ... | ... |
@@ -2652,3 +2644,3 @@ |
| 2652 | 2644 |
/// |
| 2653 |
///\ |
|
| 2645 |
///\tparam G The type of the underlying digraph. |
|
| 2654 | 2646 |
/// |
| ... | ... |
@@ -42,3 +42,3 @@ |
| 42 | 42 |
/// A structure for representing directed path in a digraph. |
| 43 |
/// \ |
|
| 43 |
/// \tparam _Digraph The digraph type in which the path is. |
|
| 44 | 44 |
/// |
| ... | ... |
@@ -230,3 +230,3 @@ |
| 230 | 230 |
/// A structure for representing directed path in a digraph. |
| 231 |
/// \ |
|
| 231 |
/// \tparam _Digraph The digraph type in which the path is. |
|
| 232 | 232 |
/// |
| ... | ... |
@@ -394,3 +394,3 @@ |
| 394 | 394 |
/// A structure for representing directed path in a digraph. |
| 395 |
/// \ |
|
| 395 |
/// \tparam _Digraph The digraph type in which the path is. |
|
| 396 | 396 |
/// |
| ... | ... |
@@ -734,3 +734,3 @@ |
| 734 | 734 |
/// A structure for representing directed path in a digraph. |
| 735 |
/// \ |
|
| 735 |
/// \tparam _Digraph The digraph type in which the path is. |
|
| 736 | 736 |
/// |
0 comments (0 inline)