equal
deleted
inserted
replaced
119 }; |
119 }; |
120 |
120 |
121 ///Euler iterator for undirected graphs. |
121 ///Euler iterator for undirected graphs. |
122 |
122 |
123 /// \ingroup topology |
123 /// \ingroup topology |
124 ///This iterator converts to the \c Edge (or \cUEdge) |
124 ///This iterator converts to the \c Edge (or \c UEdge) |
125 ///type of the graph and using |
125 ///type of the graph and using |
126 ///operator ++ it provides an Euler tour of an \undirected |
126 ///operator ++ it provides an Euler tour of an undirected |
127 ///graph (if there exists). |
127 ///graph (if there exists). |
128 /// |
128 /// |
129 ///For example |
129 ///For example |
130 ///if the given graph if Euler (i.e it has only one nontrivial component |
130 ///if the given graph if Euler (i.e it has only one nontrivial component |
131 ///and the degree of each node is even), |
131 ///and the degree of each node is even), |