writer class, then he calls the \c run() method that executes all the given

 writer class, then he calls the \c run() method that executes all the given

 commands.

 commands.

 \subsection write Writing a graph

 \subsection write Writing a graph

 you should first give writing commands to the writer. You can declare

 you should first give writing commands to the writer. You can declare

 writing command as \c NodeMap or \c EdgeMap writing and labeled Node and

 writing command as \c NodeMap or \c EdgeMap writing and labeled Node and

 Edge writing.

 Edge writing.

 \code

 \code

 GraphWriter<ListGraph> writer(std::cout, graph);

 GraphWriter<ListGraph> writer(std::cout, graph);

 \endcode

 \endcode

 object as parameters. The NodeMap writing command with name "id" should write a 

 object as parameters. The NodeMap writing command with name "id" should write a 

 unique map because it will be regarded as an ID map.

 unique map because it will be regarded as an ID map.

 \see IdMap, DescriptorMap  

 \see IdMap, DescriptorMap  

 writer.writeNodeMap("x-coord", xCoordMap);

 writer.writeNodeMap("x-coord", xCoordMap);

 writer.writeNodeMap("y-coord", yCoordMap);

 writer.writeNodeMap("y-coord", yCoordMap);

 writer.writeNodeMap("color", colorMap);

 writer.writeNodeMap("color", colorMap);

 \endcode

 \endcode

 writing command similar to the NodeMaps.

 writing command similar to the NodeMaps.

 \see IdMap, DescriptorMap  

 \see IdMap, DescriptorMap  

 \code

 \code

 writer.writeEdgeMap("weight", weightMap);

 writer.writeEdgeMap("weight", weightMap);

 writer.writeEdgeMap("label", labelMap);

 writer.writeEdgeMap("label", labelMap);

 \endcode

 \endcode

 Edges in the graph. For example, you can write out the source and target node

 Edges in the graph. For example, you can write out the source and target node

 of a maximum flow instance.

 of a maximum flow instance.

 \code

 \code

 writer.writeNode("source", sourceNode);

 writer.writeNode("source", sourceNode);

 writer.writeNode("target", targetNode);

 writer.writeNode("target", targetNode);

 writer.writeEdge("observed", edge);

 writer.writeEdge("observed", edge);

 \endcode

 \endcode

 \code

 \code

 writer.writeAttribute("author", "Balazs DEZSO");

 writer.writeAttribute("author", "Balazs DEZSO");

 writer.writeAttribute("version", 12);

 writer.writeAttribute("version", 12);

 \endcode

 \endcode

 function, which executes all the writing commands.

 function, which executes all the writing commands.

 \code

 \code

 writer.run();

 writer.run();

 \endcode

 \endcode

 \subsection reading Reading a graph

 \subsection reading Reading a graph

 The file to be read may contain several maps and labeled nodes or edges.

 The file to be read may contain several maps and labeled nodes or edges.

 If you read a graph you need not read all the maps and items just those

 If you read a graph you need not read all the maps and items just those

 given commands.

 given commands.

 The reader object assumes that each not readed value does not contain 

 The reader object assumes that each not readed value does not contain 

 whitespaces, therefore it has some extra possibilities to control how

 whitespaces, therefore it has some extra possibilities to control how

 it should skip the values when the string representation contains spaces.

 it should skip the values when the string representation contains spaces.

 \code

 \code

 GraphReader<ListGraph> reader(std::cin, graph);

 GraphReader<ListGraph> reader(std::cin, graph);

 \endcode

 \endcode

 If there is a map that you do not want to read from the file and there are

 If there is a map that you do not want to read from the file and there are

 whitespaces in the string represenation of the values then you should

 whitespaces in the string represenation of the values then you should

 \see QuotedStringReader

 \see QuotedStringReader

 \code

 \code

 reader.readNodeMap("x-coord", xCoordMap);

 reader.readNodeMap("x-coord", xCoordMap);

 reader.skipNodeMap<QuotedStringReader>("description");

 reader.skipNodeMap<QuotedStringReader>("description");

 reader.readNodeMap("color", colorMap);

 reader.readNodeMap("color", colorMap);

 \endcode

 \endcode

 reading command similar to the NodeMaps. 

 reading command similar to the NodeMaps. 

 \code

 \code

 reader.readEdgeMap("weight", weightMap);

 reader.readEdgeMap("weight", weightMap);

 reader.readEdgeMap("label", labelMap);

 reader.readEdgeMap("label", labelMap);

 \endcode

 \endcode

 Edges.

 Edges.

 \code

 \code

 reader.readNode("source", sourceNode);

 reader.readNode("source", sourceNode);

 reader.readNode("target", targetNode);

 reader.readNode("target", targetNode);

 reader.readEdge("observed", edge);

 reader.readEdge("observed", edge);

 \endcode

 \endcode

 \code

 \code

 std::string author;

 std::string author;

 writer.readAttribute("author", author);

 writer.readAttribute("author", author);

 int version;

 int version;

 writer.writeAttribute("version", version);

 writer.writeAttribute("version", version);

 \endcode

 \endcode

 function, which executes all the commands.

 function, which executes all the commands.

 \code

 \code

 reader.run();

 reader.run();

 \endcode

 \endcode

 \anchor rwbackground

 \anchor rwbackground

 \section types Background of Reading and Writing

 \section types Background of Reading and Writing

 To read a map (on the nodes or edges)

 To read a map (on the nodes or edges)

 By the default implementation the input operator reads a value from

 By the default implementation the input operator reads a value from

 the stream and the type of the readed value is the value type of the given map.

 the stream and the type of the readed value is the value type of the given map.

 When the reader should skip a value in the stream, because you do not

 When the reader should skip a value in the stream, because you do not

 want to store it in a map, the reader skips a character sequence without 

 want to store it in a map, the reader skips a character sequence without 

 whitespaces. 

 whitespaces. 

 undiredge 1

 undiredge 1

 +edge 5

 +edge 5

 -back 5

 -back 5

 \endcode

 \endcode

 \code

 \code

 reader.readUndirEdgeMap("capacity", capacityMap);

 reader.readUndirEdgeMap("capacity", capacityMap);

 reader.readEdgeMap("flow", flowMap);

 reader.readEdgeMap("flow", flowMap);

 ...

 ...

 more sections, each starting with a line identifying its type 

 more sections, each starting with a line identifying its type 

 (the word starting with the \c \@  character).

 (the word starting with the \c \@  character).

 The content of the section this way cannot contain line with \c \@ first

 The content of the section this way cannot contain line with \c \@ first

 character. The file may contains comment lines with \c # first character.

 character. The file may contains comment lines with \c # first character.

 write sections. There are various section reader and section writer

 write sections. There are various section reader and section writer

 There are default section readers and writers for reading and writing

 There are default section readers and writers for reading and writing

 item sets, and labeled items in the graph. These read and write

 item sets, and labeled items in the graph. These read and write

 the format described above. Other type of data can be handled with own

 the format described above. Other type of data can be handled with own

 section reader and writer classes which are inherited from the

 section reader and writer classes which are inherited from the

 The next example defines a special section reader which reads the

 The next example defines a special section reader which reads the

 \c \@description sections into a string:

 \c \@description sections into a string:

 \code 

 \code 

 multiple edgesets can be stored to the same nodeset. It can be used 

 multiple edgesets can be stored to the same nodeset. It can be used 

 for example as a network traffic matrix.

 for example as a network traffic matrix.

 In our example there is a network with symmetric links and there are assymetric

 In our example there is a network with symmetric links and there are assymetric

 traffic request on the network. This construction can be stored in an

 traffic request on the network. This construction can be stored in an

 \code

 \code

 UndirListGraph network;

 UndirListGraph network;

 UndirListGraph::UndirEdgeSet<double> capacity;

 UndirListGraph::UndirEdgeSet<double> capacity;

 NewEdgeSetAdaptor<UndirListGraph> traffic(network);

 NewEdgeSetAdaptor<UndirListGraph> traffic(network);

 edgesetReader.readEdgeMap("request", request);

 edgesetReader.readEdgeMap("request", request);

 reader.run();

 reader.run();

 \endcode

 \endcode

 \code

 \code

 UndirListGraph network;

 UndirListGraph network;

 UndirListGraph::UndirEdgeSet<double> capacity;

 UndirListGraph::UndirEdgeSet<double> capacity;