Skip to content

Instantly share code, notes, and snippets.

@radzionc

radzionc/get_possible_next_nodes.py

Created April 8, 2019 03:02
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save radzionc/9188ddde209ea692ed9c96de4e346805 to your computer and use it in GitHub Desktop.
Save radzionc/9188ddde209ea692ed9c96de4e346805 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
get_possible_next_nodes.py
def get_possible_next_nodes(loop, not_visited):
last_node = loop[-1]
nodes_in_row = [n for n in not_visited if n[0] == last_node[0]]
nodes_in_column = [n for n in not_visited if n[1] == last_node[1]]
if len(loop) < 2:
return nodes_in_row + nodes_in_column
else:
prev_node = loop[-2]
row_move = prev_node[0] == last_node[0]
if row_move: return nodes_in_column
return nodes_in_row
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment