equal
deleted
inserted
replaced
1 // -*- mode:C++ -*- |
1 // -*- c++ -*- |
2 |
2 |
3 #ifndef HUGO_FULL_GRAPH_H |
3 #ifndef HUGO_FULL_GRAPH_H |
4 #define HUGO_FULL_GRAPH_H |
4 #define HUGO_FULL_GRAPH_H |
5 |
5 |
6 ///\ingroup graphs |
6 ///\ingroup graphs |
18 /// @{ |
18 /// @{ |
19 |
19 |
20 ///A full graph class. |
20 ///A full graph class. |
21 |
21 |
22 ///This is a simple and fast directed full graph implementation. |
22 ///This is a simple and fast directed full graph implementation. |
23 ///It it completely static, so you can neither add nor delete either |
23 ///It is completely static, so you can neither add nor delete either |
24 ///edges or nodes. |
24 ///edges or nodes. |
25 ///Otherwise it conforms to the graph interface documented under |
25 ///Otherwise it conforms to the graph interface documented under |
26 ///the description of \ref GraphSkeleton. |
26 ///the description of \ref GraphSkeleton. |
27 ///\sa \ref GraphSkeleton. |
27 ///\sa \ref GraphSkeleton. |
28 ///\todo Shouldn't we avoid loops? |
28 ///\todo Shouldn't we avoid loops? |