public void calculate()
	{		
		// Adds the distance from X to Zone #2
		// to the distance from Zone #2 -> Zone #3
		for(int i = 0; i < m; i++)
		{
			for(int i2 = 0; i2 < n; i2++)
			{
				ZoneTwotoZoneThree[i][i2] += XtoZoneOne[i];
			}
		}

		// Adds the distance from zone #3 to Y
		// to the distance from Zone #2 to Zone #3
		for(int i = 0; i < m; i++)
		{
			for(int i2 = 0; i2 < n; i2++)
			{
				ZoneTwotoZoneThree[i][i2] += ZoneThreetoY[i2];
			}
		}

		shortest = ZoneTwotoZoneThree[0][0];
		stationOneIndex = 0;
		stationTwoIndex = 0;

		// Checks for the shortest path from Zone 1 to Zone 2
		for(int i = 0; i < m; i++)
		{
			for(int i2 = 0; i2 < n; i2++)
			{
				if(ZoneTwotoZoneThree[i][i2] <= shortest)
				{
					shortest = ZoneTwotoZoneThree[i][i2];
					stationOneIndex = i;
					stationTwoIndex = i2;
				}
			}
		}
		System.out.println("Shortest path is: " + shortest + " through stations " + (stationOneIndex + 1) + " and " + (stationTwoIndex + 1));
	}