.
1.1 --- a/src/work/alpar/emptygraph.h Mon Mar 15 16:30:20 2004 +0000
1.2 +++ b/src/work/alpar/emptygraph.h Mon Mar 15 16:42:26 2004 +0000
1.3 @@ -12,6 +12,9 @@
1.4
1.5 /// An empty graph class.
1.6
1.7 + /// When you read this for the first time,
1.8 + /// please send an e-mail to alpar\@cs.elte.hu.
1.9 + ///
1.10 /// This class provides all the common features of a graph structure,
1.11 /// however completely without implementations and real data structures
1.12 /// behind the interface.
2.1 --- a/src/work/alpar/smart_graph.h Mon Mar 15 16:30:20 2004 +0000
2.2 +++ b/src/work/alpar/smart_graph.h Mon Mar 15 16:42:26 2004 +0000
2.3 @@ -14,6 +14,9 @@
2.4
2.5 ///A smart graph class.
2.6
2.7 + /// When you read this for the first time,
2.8 + /// please send an e-mail to alpar\@cs.elte.hu.
2.9 + ///
2.10 ///This is a simple and fast graph implementation.
2.11 ///It is also quite memory efficient, but at the price
2.12 ///that <b> it does not support node and edge deletion</b>.