160 /// |
160 /// |
161 /// This type fully conforms to the \ref concepts::Digraph "Digraph concept". |
161 /// This type fully conforms to the \ref concepts::Digraph "Digraph concept". |
162 /// Most of its member functions and nested classes are documented |
162 /// Most of its member functions and nested classes are documented |
163 /// only in the concept class. |
163 /// only in the concept class. |
164 /// |
164 /// |
|
165 /// This class provides constant time counting for nodes and arcs. |
|
166 /// |
165 /// \note FullDigraph and FullGraph classes are very similar, |
167 /// \note FullDigraph and FullGraph classes are very similar, |
166 /// but there are two differences. While this class conforms only |
168 /// but there are two differences. While this class conforms only |
167 /// to the \ref concepts::Digraph "Digraph" concept, FullGraph |
169 /// to the \ref concepts::Digraph "Digraph" concept, FullGraph |
168 /// conforms to the \ref concepts::Graph "Graph" concept, |
170 /// conforms to the \ref concepts::Graph "Graph" concept, |
169 /// moreover FullGraph does not contain a loop for each |
171 /// moreover FullGraph does not contain a loop for each |
202 /// \brief Returns the node with the given index. |
204 /// \brief Returns the node with the given index. |
203 /// |
205 /// |
204 /// Returns the node with the given index. Since this structure is |
206 /// Returns the node with the given index. Since this structure is |
205 /// completely static, the nodes can be indexed with integers from |
207 /// completely static, the nodes can be indexed with integers from |
206 /// the range <tt>[0..nodeNum()-1]</tt>. |
208 /// the range <tt>[0..nodeNum()-1]</tt>. |
|
209 /// The index of a node is the same as its ID. |
207 /// \sa index() |
210 /// \sa index() |
208 Node operator()(int ix) const { return Parent::operator()(ix); } |
211 Node operator()(int ix) const { return Parent::operator()(ix); } |
209 |
212 |
210 /// \brief Returns the index of the given node. |
213 /// \brief Returns the index of the given node. |
211 /// |
214 /// |
212 /// Returns the index of the given node. Since this structure is |
215 /// Returns the index of the given node. Since this structure is |
213 /// completely static, the nodes can be indexed with integers from |
216 /// completely static, the nodes can be indexed with integers from |
214 /// the range <tt>[0..nodeNum()-1]</tt>. |
217 /// the range <tt>[0..nodeNum()-1]</tt>. |
|
218 /// The index of a node is the same as its ID. |
215 /// \sa operator()() |
219 /// \sa operator()() |
216 static int index(const Node& node) { return Parent::index(node); } |
220 static int index(const Node& node) { return Parent::index(node); } |
217 |
221 |
218 /// \brief Returns the arc connecting the given nodes. |
222 /// \brief Returns the arc connecting the given nodes. |
219 /// |
223 /// |
533 /// |
537 /// |
534 /// This type fully conforms to the \ref concepts::Graph "Graph concept". |
538 /// This type fully conforms to the \ref concepts::Graph "Graph concept". |
535 /// Most of its member functions and nested classes are documented |
539 /// Most of its member functions and nested classes are documented |
536 /// only in the concept class. |
540 /// only in the concept class. |
537 /// |
541 /// |
|
542 /// This class provides constant time counting for nodes, edges and arcs. |
|
543 /// |
538 /// \note FullDigraph and FullGraph classes are very similar, |
544 /// \note FullDigraph and FullGraph classes are very similar, |
539 /// but there are two differences. While FullDigraph |
545 /// but there are two differences. While FullDigraph |
540 /// conforms only to the \ref concepts::Digraph "Digraph" concept, |
546 /// conforms only to the \ref concepts::Digraph "Digraph" concept, |
541 /// this class conforms to the \ref concepts::Graph "Graph" concept, |
547 /// this class conforms to the \ref concepts::Graph "Graph" concept, |
542 /// moreover this class does not contain a loop for each |
548 /// moreover this class does not contain a loop for each |
577 /// \brief Returns the node with the given index. |
583 /// \brief Returns the node with the given index. |
578 /// |
584 /// |
579 /// Returns the node with the given index. Since this structure is |
585 /// Returns the node with the given index. Since this structure is |
580 /// completely static, the nodes can be indexed with integers from |
586 /// completely static, the nodes can be indexed with integers from |
581 /// the range <tt>[0..nodeNum()-1]</tt>. |
587 /// the range <tt>[0..nodeNum()-1]</tt>. |
|
588 /// The index of a node is the same as its ID. |
582 /// \sa index() |
589 /// \sa index() |
583 Node operator()(int ix) const { return Parent::operator()(ix); } |
590 Node operator()(int ix) const { return Parent::operator()(ix); } |
584 |
591 |
585 /// \brief Returns the index of the given node. |
592 /// \brief Returns the index of the given node. |
586 /// |
593 /// |
587 /// Returns the index of the given node. Since this structure is |
594 /// Returns the index of the given node. Since this structure is |
588 /// completely static, the nodes can be indexed with integers from |
595 /// completely static, the nodes can be indexed with integers from |
589 /// the range <tt>[0..nodeNum()-1]</tt>. |
596 /// the range <tt>[0..nodeNum()-1]</tt>. |
|
597 /// The index of a node is the same as its ID. |
590 /// \sa operator()() |
598 /// \sa operator()() |
591 static int index(const Node& node) { return Parent::index(node); } |
599 static int index(const Node& node) { return Parent::index(node); } |
592 |
600 |
593 /// \brief Returns the arc connecting the given nodes. |
601 /// \brief Returns the arc connecting the given nodes. |
594 /// |
602 /// |