The instances used in the paper "Risk Averse Shortest Paths: A Computational study." are - as described in subsection 4.1 - grid networks of different sizes with differently shaped highways.

Each instance consists of two files:
	-One containing the node information: 
		{highway shape}_{grid sidelength in # of nodes}_nodes.csv

	-One containing the edge information: 
		{highway shape}_{grid sidelength in # of nodes}_edges.csv

There is three types of highway: 
	-straight cross (straight)
	-tilded cross (tilted)
	-ring shaped (ring)

And five different sidelengths in number of nodes: 5, 7, 10, 13 and 15 nodes.

Each node data file is as follows:
	-The first line is the header of the file and should be ignored when reading the data.

	-Each entry line contains the id of each node, its latitude in millionth of degrees (10E-6) and its longitude in millionth of degrees (10E-6).
		{node id};{latitude};{longitude}
	 The latitude and longitude are included here so that the reader can generate real distances from them.

	-The last line contains an #EOF symbol indicating the end of the file.

Each edge data file is as follows:
	-The first line is the header of the file and should be ignored when reading the data.

	-Each entry line contains the id of each edge, the id of its tail node, the id of its head node and its type (1:regular street or 0:highway) 
		{edge id};{tail node id};{head node id};{edge type}

	-The last line contains an #EOF symbol indicating the end of the file.

