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 |
170 /// the \ref concept::Graph "Graph" concept and |
|
171 ///it also has an |
|
172 ///important extra feature that |
|
173 ///its maps are real \ref concept::ReferenceMap "reference map"s. |
171 /// \sa concept::Graph. |
174 /// \sa concept::Graph. |
172 /// |
175 /// |
173 /// \sa FullUGraph |
176 /// \sa FullUGraph |
174 /// |
177 /// |
175 /// \author Alpar Juttner |
178 /// \author Alpar Juttner |
376 /// edges or nodes. |
379 /// edges or nodes. |
377 /// |
380 /// |
378 /// The main difference beetween the \e FullGraph and \e FullUGraph class |
381 /// The main difference beetween the \e FullGraph and \e FullUGraph class |
379 /// is that this class conforms to the undirected graph concept and |
382 /// is that this class conforms to the undirected graph concept and |
380 /// it does not contain the loop edges. |
383 /// it does not contain the loop edges. |
|
384 /// |
|
385 ///It also has an |
|
386 ///important extra feature that |
|
387 ///its maps are real \ref concept::ReferenceMap "reference map"s. |
381 /// |
388 /// |
382 /// \sa FullGraph |
389 /// \sa FullGraph |
383 /// |
390 /// |
384 /// \author Balazs Dezso |
391 /// \author Balazs Dezso |
385 class FullUGraph : public ExtendedFullUGraphBase { |
392 class FullUGraph : public ExtendedFullUGraphBase { |