Linkages.csv

The final route input file is responsible for linking each block with an entry point on to the road network. This simple file (linkages.csv) contains only two fields: BLOCK and NODE. This file must indicate the closest node to each block. This file defines the relationship between harvest polygons and the road network. You must regenerate this file each time you edit your blocks file.

Each block that will require road access at some point in the planning horizon must have a linkage node. The road network must be sufficiently dense so that linkages vertices are close to the blocks. The distance from the block to the starting vertex is roughly analagous to the forwarding distance from the block to the landing. Several blocks may use the same starting vertex, however each block can only be associated with a single vertex. Below is an example of several linkages.csv records:


	  BLOCK,NODE
	  1,856
	  2,856
	  3,856
	  4,805
	  5,858
	  6,858
	  7,859
	  8,860
	  9,860
	  10,861
	  11,862
	  ...

	

Notice that block 1, 2 and 3 are all linked to node 856. This type of relationship is similar to several blocks forwarding to the same landing.