equal
deleted
inserted
replaced
16 /// All graph algorithms should compile with this class, but it will not |
16 /// All graph algorithms should compile with this class, but it will not |
17 /// run properly, of course. |
17 /// run properly, of course. |
18 /// |
18 /// |
19 /// It can be used for checking the interface compatibility, |
19 /// It can be used for checking the interface compatibility, |
20 /// or it can serve as a skeleton of a new graph structure. |
20 /// or it can serve as a skeleton of a new graph structure. |
21 |
21 /// |
|
22 /// Also, you will find here the full documentation of a certain graph |
|
23 /// feature, the documentation of a real graph imlementation |
|
24 /// like @ref ListGraph or |
|
25 /// @ref SmartGraph will just refer to this structure. |
22 class EmptyGraph |
26 class EmptyGraph |
23 { |
27 { |
24 public: |
28 public: |
25 |
29 |
26 /// The base type of the node iterators. |
30 /// The base type of the node iterators. |