- SmallGraph is also a class instead of being a typedef.
(For the sake of doxygen.)
1.1 --- a/src/lemon/full_graph.h Sat Oct 30 18:33:14 2004 +0000
1.2 +++ b/src/lemon/full_graph.h Sat Oct 30 18:51:00 2004 +0000
1.3 @@ -37,18 +37,6 @@
1.4 /// \addtogroup graphs
1.5 /// @{
1.6
1.7 - ///A full graph class.
1.8 -
1.9 - ///This is a simple and fast directed full graph implementation.
1.10 - ///It is completely static, so you can neither add nor delete either
1.11 - ///edges or nodes.
1.12 - ///Thus it conforms to
1.13 - ///the \ref skeleton::StaticGraph "StaticGraph" concept
1.14 - ///\sa skeleton::StaticGraph.
1.15 - ///\todo What about loops?
1.16 - ///\todo Don't we need SymEdgeMap?
1.17 - ///
1.18 - ///\author Alpar Juttner
1.19 class FullGraphBase {
1.20 int NodeNum;
1.21 int EdgeNum;
1.22 @@ -200,6 +188,18 @@
1.23 typedef IdMappableGraphExtender<IterableFullGraphBase> IdMappableFullGraphBase;
1.24 typedef DefaultMappableGraphExtender<IdMappableFullGraphBase> MappableFullGraphBase;
1.25
1.26 + ///A full graph class.
1.27 +
1.28 + ///This is a simple and fast directed full graph implementation.
1.29 + ///It is completely static, so you can neither add nor delete either
1.30 + ///edges or nodes.
1.31 + ///Thus it conforms to
1.32 + ///the \ref skeleton::StaticGraph "StaticGraph" concept
1.33 + ///\sa skeleton::StaticGraph.
1.34 + ///\todo What about loops?
1.35 + ///\todo Don't we need SymEdgeMap?
1.36 + ///
1.37 + ///\author Alpar Juttner
1.38 class FullGraph : public MappableFullGraphBase {
1.39 public:
1.40