equal
deleted
inserted
replaced
32 |
32 |
33 /**************** Graph iterator concepts ****************/ |
33 /**************** Graph iterator concepts ****************/ |
34 |
34 |
35 /// Skeleton class for graph Node and Edge types |
35 /// Skeleton class for graph Node and Edge types |
36 |
36 |
37 /// This class describes the interface of Node and Edge (and UndirEdge |
37 /// This class describes the interface of Node and Edge (and UEdge |
38 /// in undirected graphs) subtypes of graph types. |
38 /// in undirected graphs) subtypes of graph types. |
39 /// |
39 /// |
40 /// \note This class is a template class so that we can use it to |
40 /// \note This class is a template class so that we can use it to |
41 /// create graph skeleton classes. The reason for this is than Node |
41 /// create graph skeleton classes. The reason for this is than Node |
42 /// and Edge types should \em not derive from the same base class. |
42 /// and Edge types should \em not derive from the same base class. |