This definately cant do go wrong

public void check_electricity(int pos ,int curr_network){
		Vertex2d positions = ship.cable_pos(pos);
		if (positions.x != -1) {
			if (ship.map[(int) positions.x].get_network() != curr_network) {
				ship.map[(int) positions.x].set_network(curr_network);
				check_electricity((int)positions.x,curr_network);
			}
		}
		if (positions.y != -1) {
			if (ship.map[(int) positions.y].get_network() != curr_network) {
				ship.map[(int) positions.y].set_network(curr_network);
				check_electricity((int)positions.y,curr_network);
			}
		}
		if (positions.u != -1) {
			if (ship.map[(int) positions.u].get_network() != curr_network) {
				ship.map[(int) positions.u].set_network(curr_network);
				check_electricity((int)positions.u,curr_network);
			}
		}
		if (positions.v != -1) {
			if (ship.map[(int) positions.v].get_network() != curr_network) {
				ship.map[(int) positions.v].set_network(curr_network);
				check_electricity((int)positions.v,curr_network);
			}
		}
	}

??? :-\ :expressionless: :-\ :clue: ???

What’s this thread about? Care to add some explanation? :point:

Its a quick mock up of recursion for discovering electricity networks within a tile system. Now knowing how often code turns out correctly I can feel this making my CPU have a crying fit sooner or later. More of a thread just to show code that is in someways going to end the world … eventually.