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
这里的dfs函数只是做了一个简单的深度优先遍历节点,path并不是最终的回路,比如下面这个测试样例的path结果就不正确:
{ { {0, 1, 1, 0, 0}, {1, 0, 1, 1, 1}, {1, 1, 0, 0, 0}, {0, 1, 0, 0, 1}, {0, 1, 0, 1, 0}, }, 5, true, },
此外,EulerCycleTest.cpp中的倒数第二个测试样例也不对,节点数和图不符。
The text was updated successfully, but these errors were encountered:
我最近的精力已经没有再继续维护了,等我有时间会再看下这个问题。如果您有兴趣也可以提交PR给我!
Sorry, something went wrong.
No branches or pull requests
这里的dfs函数只是做了一个简单的深度优先遍历节点,path并不是最终的回路,比如下面这个测试样例的path结果就不正确:
此外,EulerCycleTest.cpp中的倒数第二个测试样例也不对,节点数和图不符。
The text was updated successfully, but these errors were encountered: