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

Optimize Subgraph Matching #3

Open

TACIXAT opened this issue Sep 28, 2014 · 0 comments

Owner

TACIXAT commented Sep 28, 2014

A return code might be better than the true / false. Will allow early escape when we reach a depth with insufficient nodes below it.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment