Changeset 97:ee1324c91288 in lemon for lemon/path_utils.h
- Timestamp:
- 01/24/08 17:49:10 (16 years ago)
- Branch:
- default
- Phase:
- public
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/path_utils.h
r96 r97 91 91 92 92 93 /// \brief Make ofcopy of a path.94 /// 95 /// Make ofcopy of a path.93 /// \brief Make a copy of a path. 94 /// 95 /// This function makes a copy of a path. 96 96 template <typename Target, typename Source> 97 97 void copyPath(Target& target, const Source& source) { … … 100 100 } 101 101 102 /// \brief Checks the path's consistency. 103 /// 104 /// Checks that each arc's target is the next's source. 102 /// \brief Check the consistency of a path. 103 /// 104 /// This function checks that the target of each arc is the same 105 /// as the source of the next one. 105 106 /// 106 107 template <typename Digraph, typename Path> … … 118 119 } 119 120 120 /// \brief Gives back the source of thepath121 /// 122 /// Gives back the source of thepath.121 /// \brief The source of a path 122 /// 123 /// This function returns the source of the given path. 123 124 template <typename Digraph, typename Path> 124 125 typename Digraph::Node pathSource(const Digraph& digraph, const Path& path) { … … 126 127 } 127 128 128 /// \brief Gives back the target of thepath129 /// 130 /// Gives back the target of thepath.129 /// \brief The target of a path 130 /// 131 /// This function returns the target of the given path. 131 132 template <typename Digraph, typename Path> 132 133 typename Digraph::Node pathTarget(const Digraph& digraph, const Path& path) { … … 134 135 } 135 136 136 /// \brief Class which helps to iterate th e nodes of a path137 /// \brief Class which helps to iterate through the nodes of a path 137 138 /// 138 139 /// In a sense, the path can be treated as a list of arcs. The 139 /// lemon path type stores just this list. As a consequenceit140 /// lemon path type stores only this list. As a consequence, it 140 141 /// cannot enumerate the nodes in the path and the zero length paths 141 /// cannot store the node.142 /// cannot have a source node. 142 143 /// 143 144 /// This class implements the node iterator of a path structure. To 144 /// provide this feature, the underlying digraph should be givento145 /// provide this feature, the underlying digraph should be passed to 145 146 /// the constructor of the iterator. 146 147 template <typename Path>
Note: See TracChangeset
for help on using the changeset viewer.