1.1 --- a/doc/graph_io.dox	Wed Apr 27 10:42:58 2005 +0000
     1.2 +++ b/doc/graph_io.dox	Wed Apr 27 10:44:58 2005 +0000
     1.3 @@ -89,7 +89,7 @@
     1.4  GraphWriter<ListGraph> writer(std::cout, graph);
     1.5  \endcode
     1.6  
     1.7 -The \c addNodeMap() function declares a \c NodeMap writing command in the
     1.8 +The \c writeNodeMap() function declares a \c NodeMap writing command in the
     1.9  \c GraphWriter. You should give as parameter the name of the map and the map
    1.10  object. The NodeMap writing command with name "id" should write a 
    1.11  unique map because it is regarded as ID map.
    1.12 @@ -98,34 +98,34 @@
    1.13  
    1.14  \code
    1.15  IdMap<ListGraph, Node> nodeIdMap;
    1.16 -writer.addNodeMap("id", nodeIdMap);
    1.17 +writer.writeNodeMap("id", nodeIdMap);
    1.18  
    1.19 -writer.addNodeMap("x-coord", xCoordMap);
    1.20 -writer.addNodeMap("y-coord", yCoordMap);
    1.21 -writer.addNodeMap("color", colorMap);
    1.22 +writer.writeNodeMap("x-coord", xCoordMap);
    1.23 +writer.writeNodeMap("y-coord", yCoordMap);
    1.24 +writer.writeNodeMap("color", colorMap);
    1.25  \endcode
    1.26  
    1.27 -With the \c addEdgeMap() member function you can give an edge map
    1.28 +With the \c writeEdgeMap() member function you can give an edge map
    1.29  writing command similar to the NodeMaps.
    1.30  
    1.31  \see IdMap, DescriptorMap  
    1.32  \code
    1.33  DescriptorMap<ListGraph, Edge, ListGraph::EdgeMap<int> > edgeDescMap(graph);
    1.34 -writer.addEdgeMap("descriptor", edgeDescMap);
    1.35 +writer.writeEdgeMap("descriptor", edgeDescMap);
    1.36  
    1.37 -writer.addEdgeMap("weight", weightMap);
    1.38 -writer.addEdgeMap("label", labelMap);
    1.39 +writer.writeEdgeMap("weight", weightMap);
    1.40 +writer.writeEdgeMap("label", labelMap);
    1.41  \endcode
    1.42  
    1.43 -With \c addNode() and \c addEdge() functions you can point out Nodes and
    1.44 +With \c writeNode() and \c writeEdge() functions you can point out Nodes and
    1.45  Edges in the graph. By example, you can write out the source and target
    1.46  of the graph.
    1.47  
    1.48  \code
    1.49 -writer.addNode("source", sourceNode);
    1.50 -writer.addNode("target", targetNode);
    1.51 +writer.writeNode("source", sourceNode);
    1.52 +writer.writeNode("target", targetNode);
    1.53  
    1.54 -writer.addEdge("observed", edge);
    1.55 +writer.writeEdge("observed", edge);
    1.56  \endcode
    1.57  
    1.58  After you give all write commands you must call the \c run() member
    1.59 @@ -151,38 +151,38 @@
    1.60  GraphReader<ListGraph> reader(std::cin, graph);
    1.61  \endcode
    1.62  
    1.63 -The \c addNodeMap() function reads a map from the \c \@nodeset section.
    1.64 +The \c readNodeMap() function reads a map from the \c \@nodeset section.
    1.65  If there is a map that you do not want to read from the file and there is
    1.66  whitespace in the string represenation of the values then you should
    1.67  call the \c skipNodeMap() template member function with proper parameters.
    1.68  
    1.69  \see QuotedStringReader
    1.70  \code
    1.71 -reader.addNodeMap("x-coord", xCoordMap);
    1.72 -reader.addNodeMap("y-coord", yCoordMap);
    1.73 +reader.readNodeMap("x-coord", xCoordMap);
    1.74 +reader.readNodeMap("y-coord", yCoordMap);
    1.75  
    1.76 -reader.addNodeMap<QuotedStringReader>("label", labelMap);
    1.77 +reader.readNodeMap<QuotedStringReader>("label", labelMap);
    1.78  reader.skipNodeMap<QuotedStringReader>("description");
    1.79  
    1.80 -reader.addNodeMap("color", colorMap);
    1.81 +reader.readNodeMap("color", colorMap);
    1.82  \endcode
    1.83  
    1.84 -With the \c addEdgeMap() member function you can give an edge map
    1.85 +With the \c readEdgeMap() member function you can give an edge map
    1.86  reading command similar to the NodeMaps. 
    1.87  
    1.88  \code
    1.89 -reader.addEdgeMap("weight", weightMap);
    1.90 -reader.addEdgeMap("label", labelMap);
    1.91 +reader.readEdgeMap("weight", weightMap);
    1.92 +reader.readEdgeMap("label", labelMap);
    1.93  \endcode
    1.94  
    1.95 -With \c addNode() and \c addEdge() functions you can read labeled Nodes and
    1.96 +With \c readNode() and \c readEdge() functions you can read labeled Nodes and
    1.97  Edges.
    1.98  
    1.99  \code
   1.100 -reader.addNode("source", sourceNode);
   1.101 -reader.addNode("target", targetNode);
   1.102 +reader.readNode("source", sourceNode);
   1.103 +reader.readNode("target", targetNode);
   1.104  
   1.105 -reader.addEdge("observed", edge);
   1.106 +reader.readEdge("observed", edge);
   1.107  \endcode
   1.108  
   1.109  After you give all read commands you must call the \c run() member
   1.110 @@ -230,7 +230,7 @@
   1.111    }
   1.112  };
   1.113  ...
   1.114 -reader.addNodeMap<LengthReader>("strings", lengthMap);
   1.115 +reader.readNodeMap<LengthReader>("strings", lengthMap);
   1.116  \endcode  
   1.117  
   1.118  The global functionality of the reader class can be changed by giving a