Open AFellner opened 11 years ago
The function should return the minimum number of children/premise steps between two nodes. A naive implementation, exploring all possible paths, would be highly inefficient. Such a function would be usefull in the Greedy TopDown pebbling.
The function should return the minimum number of children/premise steps between two nodes. A naive implementation, exploring all possible paths, would be highly inefficient. Such a function would be usefull in the Greedy TopDown pebbling.