Changeset 1630:f67737f5727a in lemon-0.x for lemon/concept/graph.h

Timestamp:

08/16/05 18:44:57 (19 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2138

Message:

Doc changes:

• True and False got documented
• Graph "developper interface" documentation switched off
• minor fix in graph_to_eps_demo.cc

File:

• lemon/concept/graph.h (modified) (3 diffs)

lemon/concept/graph.h

@@ -428 +428 @@
       Node source(Edge) const { return INVALID; }
 
-      /// Gives back the first Node in the iterating order.
-      
-      /// Gives back the first Node in the iterating order.
-      ///     
+//       /// Gives back the first Node in the iterating order.
+      
+//       /// Gives back the first Node in the iterating order.
+//       ///     
       void first(Node&) const {}
 
-      /// Gives back the next Node in the iterating order.
-      
-      /// Gives back the next Node in the iterating order.
-      ///     
+//       /// Gives back the next Node in the iterating order.
+      
+//       /// Gives back the next Node in the iterating order.
+//       ///     
       void next(Node&) const {}
 
-      /// Gives back the first Edge in the iterating order.
-      
-      /// Gives back the first Edge in the iterating order.
-      ///     
+//       /// Gives back the first Edge in the iterating order.
+      
+//       /// Gives back the first Edge in the iterating order.
+//       ///     
       void first(Edge&) const {}
-      /// Gives back the next Edge in the iterating order.
-      
-      /// Gives back the next Edge in the iterating order.
-      ///     
+//       /// Gives back the next Edge in the iterating order.
+      
+//       /// Gives back the next Edge in the iterating order.
+//       ///     
       void next(Edge&) const {}
 
 
-      /// Gives back the first of the Edges point to the given Node.
-      
-      /// Gives back the first of the Edges point to the given Node.
-      ///     
+//       /// Gives back the first of the Edges point to the given Node.
+      
+//       /// Gives back the first of the Edges point to the given Node.
+//       ///     
       void firstIn(Edge&, const Node&) const {}
 
-      /// Gives back the next of the Edges points to the given Node.
-
-
-      /// Gives back the next of the Edges points to the given Node.
-      ///
+//       /// Gives back the next of the Edges points to the given Node.
+
+
+//       /// Gives back the next of the Edges points to the given Node.
+//       ///
       void nextIn(Edge&) const {}
 
-      /// Gives back the first of the Edges start from the given Node.
-      
-      /// Gives back the first of the Edges start from the given Node.
-      ///     
+//       /// Gives back the first of the Edges start from the given Node.
+      
+//       /// Gives back the first of the Edges start from the given Node.
+//       ///     
       void firstOut(Edge&, const Node&) const {}
 
-      /// Gives back the next of the Edges start from the given Node.
-      
-      /// Gives back the next of the Edges start from the given Node.
-      ///     
+//       /// Gives back the next of the Edges start from the given Node.
+      
+//       /// Gives back the next of the Edges start from the given Node.
+//       ///     
       void nextOut(Edge&) const {}
 
@@ -512 +512 @@
       /// \warning Making maps that can handle bool type (NodeMap<bool>)
       /// needs some extra attention!
+      /// \todo Wrong documentation
       template<class T> 
       class NodeMap : public ReadWriteMap< Node, T >
@@ -535 +536 @@
       /// \warning Making maps that can handle bool type (EdgeMap<bool>)
       /// needs some extra attention!
+      /// \todo Wrong documentation
       template<class T> 
       class EdgeMap : public ReadWriteMap<Edge,T>