We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
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
Hi @ebolat, really appreciate your blog which helps me a lot with practicing my algorithms.
Just a quick question, on https://emre.me/coding-patterns/topological-sort/. You put
in_degree[child] += 1
but this should be out_degree as there are no edges coming into the child?
out_degree
Or should be in_degree[parent] += 1 but then in your hashmap needs to be graph[child].append(parent)
in_degree[parent] += 1
graph[child].append(parent)
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Hi @ebolat, really appreciate your blog which helps me a lot with practicing my algorithms.
Just a quick question, on https://emre.me/coding-patterns/topological-sort/. You put
but this should be
out_degree
as there are no edges coming into the child?Or should be
in_degree[parent] += 1
but then in your hashmap needs to begraph[child].append(parent)
The text was updated successfully, but these errors were encountered: