Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Implement efficient function for distance of nodes #89

Open
AFellner opened this issue Sep 2, 2013 · 0 comments
Open

Implement efficient function for distance of nodes #89

AFellner opened this issue Sep 2, 2013 · 0 comments

Comments

@AFellner
Copy link
Contributor

AFellner commented Sep 2, 2013

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.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@AFellner