This repository has been archived by the owner on Dec 5, 2019. It is now read-only.

Resolved dependency graph sort algorithm is very inefficient #48

Open

jspahrsummers opened this issue Sep 5, 2016 · 1 comment

Labels

bug help wanted

Member

jspahrsummers commented Sep 5, 2016

It seems to have at least exponential complexity. I'm sure there's something better than my first pass implementation.

jspahrsummers added bug help wanted labels

Member Author

jspahrsummers commented Sep 18, 2016

NB: this touches the same code as #72.

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