       dist_between = neighbor.distance
       tentative_g_score = current_node.g + dist_between
 
-      if neighbor_node.closed and (tentative_g_score >= neighbor_node.g)
+      if neighbor_node.closed# and (tentative_g_score >= neighbor_node.g)
         continue
 
       if (neighbor_id not in open_nodes) or (tentative_g_score < neighbor_node.g)

console.log("Processing")

exports.nav = (req, res) ->
  start = req.query.start
  end = req.query.end
  res.send(astar(start, end))

astar = (start, end) ->


  # Copy the array of intersections
  nodes = []
  for id, node of intersections
    new_node = []
    for prop, val of node
