equal
deleted
inserted
replaced
112 \dontinclude topological_ordering.cc |
112 \dontinclude topological_ordering.cc |
113 First of all we will need an own \ref lemon::Dfs::ProcessedMap "ProcessedMap". The ordering |
113 First of all we will need an own \ref lemon::Dfs::ProcessedMap "ProcessedMap". The ordering |
114 will be done through it. |
114 will be done through it. |
115 \skip MyOrdererMap |
115 \skip MyOrdererMap |
116 \until }; |
116 \until }; |
117 The class meets the \ref lemon::WriteMap "WriteMap" concept. In it's \c set() method the only thing |
117 The class meets the \ref concepts::WriteMap "WriteMap" concept. In it's \c set() method the only thing |
118 we need to do is insert the key - that is the node whose processing just finished - into the beginning |
118 we need to do is insert the key - that is the node whose processing just finished - into the beginning |
119 of the list.<br> |
119 of the list.<br> |
120 Although we implemented this needed helper class ourselves it was not necessary. |
120 Although we implemented this needed helper class ourselves it was not necessary. |
121 The \ref lemon::FrontInserterBoolMap "FrontInserterBoolMap" class does exactly |
121 The \ref lemon::FrontInserterBoolMap "FrontInserterBoolMap" class does exactly |
122 what we needed. To be correct it's more general - and it's all in \c LEMON. But |
122 what we needed. To be correct it's more general - and it's all in \c LEMON. But |