equal
deleted
inserted
replaced
390 |
390 |
391 /// \ingroup graphs |
391 /// \ingroup graphs |
392 /// |
392 /// |
393 /// \brief An undirected full graph class. |
393 /// \brief An undirected full graph class. |
394 /// |
394 /// |
395 /// This is a simple and fast directed full graph implementation. |
395 /// This is a simple and fast undirected full graph implementation. |
396 /// It is completely static, so you can neither add nor delete either |
396 /// It is completely static, so you can neither add nor delete either |
397 /// edges or nodes. |
397 /// edges or nodes. |
398 /// |
398 /// |
399 /// The main difference beetween the \e FullGraph and \e UndirFullGraph class |
399 /// The main difference beetween the \e FullGraph and \e UndirFullGraph class |
400 /// is that this class conforms to the undirected graph concept and |
400 /// is that this class conforms to the undirected graph concept and |
401 /// it does not contain the hook edges. |
401 /// it does not contain the loop edges. |
402 /// |
402 /// |
403 /// \sa FullGraph |
403 /// \sa FullGraph |
404 /// |
404 /// |
405 /// \author Balazs Dezso |
405 /// \author Balazs Dezso |
406 class UndirFullGraph : public ExtendedUndirFullGraphBase { |
406 class UndirFullGraph : public ExtendedUndirFullGraphBase { |