equal
deleted
inserted
replaced
165 /// |
165 /// |
166 /// This is a simple and fast directed full graph implementation. |
166 /// This is a simple and fast directed full graph implementation. |
167 /// It is completely static, so you can neither add nor delete either |
167 /// It is completely static, so you can neither add nor delete either |
168 /// edges or nodes. |
168 /// edges or nodes. |
169 /// Thus it conforms to |
169 /// Thus it conforms to |
170 /// the \ref concept::Graph "Graph" concept and |
170 /// the \ref concepts::Graph "Graph" concept and |
171 ///it also has an |
171 ///it also has an |
172 ///important extra feature that |
172 ///important extra feature that |
173 ///its maps are real \ref concept::ReferenceMap "reference map"s. |
173 ///its maps are real \ref concepts::ReferenceMap "reference map"s. |
174 /// \sa concept::Graph. |
174 /// \sa concepts::Graph. |
175 /// |
175 /// |
176 /// \sa FullUGraph |
176 /// \sa FullUGraph |
177 /// |
177 /// |
178 /// \author Alpar Juttner |
178 /// \author Alpar Juttner |
179 class FullGraph : public ExtendedFullGraphBase { |
179 class FullGraph : public ExtendedFullGraphBase { |
382 /// is that this class conforms to the undirected graph concept and |
382 /// is that this class conforms to the undirected graph concept and |
383 /// it does not contain the loop edges. |
383 /// it does not contain the loop edges. |
384 /// |
384 /// |
385 ///It also has an |
385 ///It also has an |
386 ///important extra feature that |
386 ///important extra feature that |
387 ///its maps are real \ref concept::ReferenceMap "reference map"s. |
387 ///its maps are real \ref concepts::ReferenceMap "reference map"s. |
388 /// |
388 /// |
389 /// \sa FullGraph |
389 /// \sa FullGraph |
390 /// |
390 /// |
391 /// \author Balazs Dezso |
391 /// \author Balazs Dezso |
392 class FullUGraph : public ExtendedFullUGraphBase { |
392 class FullUGraph : public ExtendedFullUGraphBase { |