def getKnightsPath(i,j,n):
    a = getmindegree(i,j,n)
    bn = MyBoard(n)
    for i in a:
      bn.remove_node(i)
      remove = bn.edges(i)
      bn.remove_edges_from(remove)
    #I want these values below to go back in the function to find b?

        for d in a:
        i = d[0]
        j = d[1]
        b = getmindegree(i,j,n)
return b