equal
deleted
inserted
replaced
38 |
38 |
39 |
39 |
40 /// \brief A structure for representing directed paths in a digraph. |
40 /// \brief A structure for representing directed paths in a digraph. |
41 /// |
41 /// |
42 /// A structure for representing directed path in a digraph. |
42 /// A structure for representing directed path in a digraph. |
43 /// \param Digraph The digraph type in which the path is. |
43 /// \tparam _Digraph The digraph type in which the path is. |
44 /// |
44 /// |
45 /// In a sense, the path can be treated as a list of arcs. The |
45 /// In a sense, the path can be treated as a list of arcs. The |
46 /// lemon path type stores just this list. As a consequence, it |
46 /// lemon path type stores just this list. As a consequence, it |
47 /// cannot enumerate the nodes of the path and the source node of |
47 /// cannot enumerate the nodes of the path and the source node of |
48 /// a zero length path is undefined. |
48 /// a zero length path is undefined. |
226 }; |
226 }; |
227 |
227 |
228 /// \brief A structure for representing directed paths in a digraph. |
228 /// \brief A structure for representing directed paths in a digraph. |
229 /// |
229 /// |
230 /// A structure for representing directed path in a digraph. |
230 /// A structure for representing directed path in a digraph. |
231 /// \param Digraph The digraph type in which the path is. |
231 /// \tparam _Digraph The digraph type in which the path is. |
232 /// |
232 /// |
233 /// In a sense, the path can be treated as a list of arcs. The |
233 /// In a sense, the path can be treated as a list of arcs. The |
234 /// lemon path type stores just this list. As a consequence it |
234 /// lemon path type stores just this list. As a consequence it |
235 /// cannot enumerate the nodes in the path and the zero length paths |
235 /// cannot enumerate the nodes in the path and the zero length paths |
236 /// cannot store the source. |
236 /// cannot store the source. |
390 }; |
390 }; |
391 |
391 |
392 /// \brief A structure for representing directed paths in a digraph. |
392 /// \brief A structure for representing directed paths in a digraph. |
393 /// |
393 /// |
394 /// A structure for representing directed path in a digraph. |
394 /// A structure for representing directed path in a digraph. |
395 /// \param Digraph The digraph type in which the path is. |
395 /// \tparam _Digraph The digraph type in which the path is. |
396 /// |
396 /// |
397 /// In a sense, the path can be treated as a list of arcs. The |
397 /// In a sense, the path can be treated as a list of arcs. The |
398 /// lemon path type stores just this list. As a consequence it |
398 /// lemon path type stores just this list. As a consequence it |
399 /// cannot enumerate the nodes in the path and the zero length paths |
399 /// cannot enumerate the nodes in the path and the zero length paths |
400 /// cannot store the source. |
400 /// cannot store the source. |
730 }; |
730 }; |
731 |
731 |
732 /// \brief A structure for representing directed paths in a digraph. |
732 /// \brief A structure for representing directed paths in a digraph. |
733 /// |
733 /// |
734 /// A structure for representing directed path in a digraph. |
734 /// A structure for representing directed path in a digraph. |
735 /// \param Digraph The digraph type in which the path is. |
735 /// \tparam _Digraph The digraph type in which the path is. |
736 /// |
736 /// |
737 /// In a sense, the path can be treated as a list of arcs. The |
737 /// In a sense, the path can be treated as a list of arcs. The |
738 /// lemon path type stores just this list. As a consequence it |
738 /// lemon path type stores just this list. As a consequence it |
739 /// cannot enumerate the nodes in the path and the source node of |
739 /// cannot enumerate the nodes in the path and the source node of |
740 /// a zero length path is undefined. |
740 /// a zero length path is undefined. |