# HG changeset patch
# User alpar
# Date 1079368946 0
# Node ID 35a2c1fd5d73015a0dfd851a94766f5832f9f1c3
# Parent  47cd1716870e73ae320b3915db7ca3f49fc17df9
.

diff -r 47cd1716870e -r 35a2c1fd5d73 src/work/alpar/emptygraph.h
--- a/src/work/alpar/emptygraph.h	Mon Mar 15 16:30:20 2004 +0000
+++ b/src/work/alpar/emptygraph.h	Mon Mar 15 16:42:26 2004 +0000
@@ -12,6 +12,9 @@
 
   /// An empty graph class.
   
+  /// When you read this for the first time,
+  /// please send an e-mail to alpar\@cs.elte.hu.
+  ///
   /// This class provides all the common features of a graph structure,
   /// however completely without implementations and real data structures
   /// behind the interface.
diff -r 47cd1716870e -r 35a2c1fd5d73 src/work/alpar/smart_graph.h
--- a/src/work/alpar/smart_graph.h	Mon Mar 15 16:30:20 2004 +0000
+++ b/src/work/alpar/smart_graph.h	Mon Mar 15 16:42:26 2004 +0000
@@ -14,6 +14,9 @@
 
   ///A smart graph class.
 
+  /// When you read this for the first time,
+  /// please send an e-mail to alpar\@cs.elte.hu.
+  ///
   ///This is a simple and fast graph implementation.
   ///It is also quite memory efficient, but at the price
   ///that <b> it does not support node and edge deletion</b>.