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

建议 #1

Open

xiamiy opened this issue Jun 17, 2014 · 2 comments

xiamiy commented Jun 17, 2014

遍历过的线是不是可以考虑擦除（set边为0）？

guzy commented May 28, 2015

无向图的遍历（https://github.com/wangkuiwu/datastructs_and_algorithm/blob/master/source/graph/iterator/udg/java/ListUDG.java）是不是可以去掉这层循环
for (int i = 0; i < mVexs.length; i++) {

LLLWWWJJJP99 commented Oct 21, 2016 •

edited

Loading

拓扑排序感觉的太冗杂了

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