155 /// therefore the number of the arcs in the digraph is the square of |
155 /// therefore the number of the arcs in the digraph is the square of |
156 /// the node number. This digraph type is completely static, so you |
156 /// the node number. This digraph type is completely static, so you |
157 /// can neither add nor delete either arcs or nodes, and it needs |
157 /// can neither add nor delete either arcs or nodes, and it needs |
158 /// constant space in memory. |
158 /// constant space in memory. |
159 /// |
159 /// |
160 /// This class conforms to the \ref concepts::Digraph "Digraph" concept |
160 /// This class fully conforms to the \ref concepts::Digraph |
161 /// and it also has an important extra feature that its maps are |
161 /// "Digraph concept". |
162 /// real \ref concepts::ReferenceMap "reference map"s. |
|
163 /// |
162 /// |
164 /// The \c FullDigraph and \c FullGraph classes are very similar, |
163 /// The \c FullDigraph and \c FullGraph classes are very similar, |
165 /// but there are two differences. While this class conforms only |
164 /// but there are two differences. While this class conforms only |
166 /// to the \ref concepts::Digraph "Digraph" concept, the \c FullGraph |
165 /// to the \ref concepts::Digraph "Digraph" concept, the \c FullGraph |
167 /// class conforms to the \ref concepts::Graph "Graph" concept, |
166 /// class conforms to the \ref concepts::Graph "Graph" concept, |
525 /// therefore the number of edges in the graph is \f$n(n-1)/2\f$. |
524 /// therefore the number of edges in the graph is \f$n(n-1)/2\f$. |
526 /// This graph type is completely static, so you can neither |
525 /// This graph type is completely static, so you can neither |
527 /// add nor delete either edges or nodes, and it needs constant |
526 /// add nor delete either edges or nodes, and it needs constant |
528 /// space in memory. |
527 /// space in memory. |
529 /// |
528 /// |
530 /// This class conforms to the \ref concepts::Graph "Graph" concept |
529 /// This class fully conforms to the \ref concepts::Graph "Graph concept". |
531 /// and it also has an important extra feature that its maps are |
|
532 /// real \ref concepts::ReferenceMap "reference map"s. |
|
533 /// |
530 /// |
534 /// The \c FullGraph and \c FullDigraph classes are very similar, |
531 /// The \c FullGraph and \c FullDigraph classes are very similar, |
535 /// but there are two differences. While the \c FullDigraph class |
532 /// but there are two differences. While the \c FullDigraph class |
536 /// conforms only to the \ref concepts::Digraph "Digraph" concept, |
533 /// conforms only to the \ref concepts::Digraph "Digraph" concept, |
537 /// this class conforms to the \ref concepts::Graph "Graph" concept, |
534 /// this class conforms to the \ref concepts::Graph "Graph" concept, |