equal
deleted
inserted
replaced
212 /// |
212 /// |
213 /// This is a simple and fast directed full graph implementation. |
213 /// This is a simple and fast directed full graph implementation. |
214 /// It is completely static, so you can neither add nor delete either |
214 /// It is completely static, so you can neither add nor delete either |
215 /// edges or nodes. |
215 /// edges or nodes. |
216 /// Thus it conforms to |
216 /// Thus it conforms to |
217 /// the \ref concept::StaticGraph "StaticGraph" concept |
217 /// the \ref concept::Graph "Graph" concept |
218 /// \sa concept::StaticGraph. |
218 /// \sa concept::Graph. |
219 /// |
219 /// |
220 /// \sa FullGraphBase |
220 /// \sa FullGraphBase |
221 /// \sa FullUGraph |
221 /// \sa FullUGraph |
222 /// |
222 /// |
223 /// \author Alpar Juttner |
223 /// \author Alpar Juttner |