def get_h_cost_dijkstra(node_a, node_b):
    """ Return the heuristic_cost that it takes to get from node_a to node_b.
        Heuristic: Diagonal movement cost = 14 , vertical/horizontal movement cost = 10
    """
    global HEURISTIC_COST_DIAGONAL
    global HEURISTIC_COST_VERTICAL_HORIZONTAL

    dis_x = abs(node_a.position[0] - node_b.position[0])
    dis_y = abs(node_a.position[1] - node_b.position[1])
    D = 0
    return D * (dis_x + dis_y)