GoogleCodeExporter
commented
9 years ago 0. Warnings:
main.cpp: In function 'void DFS_Visit(std::vector<std::vector<int> >&,
std::vector<clr>&, std::vector<int>&, std::vector<int>&, std::vector<int>&,
int&, int&)':
main.cpp:12:38: warning: comparison between signed and unsigned integer
expressions [-Wsign-compare]
main.cpp: In function 'void DFS_matr(std::vector<std::vector<int> >&, int)':
main.cpp:26:38: warning: comparison between signed and unsigned integer
expressions [-Wsign-compare]
main.cpp:33:38: warning: comparison between signed and unsigned integer
expressions [-Wsign-compare]
main.cpp:37:38: warning: comparison between signed and unsigned integer
expressions [-Wsign-compare]
1. Решение неверное:
number: 1 discovered: 0 finished: 35 parent: -1
number: 2 discovered: 2 finished: 33 parent: 4
number: 3 discovered: 4 finished: 31 parent: 8
number: 4 discovered: 1 finished: 34 parent: 1
number: 5 discovered: 10 finished: 15 parent: 7
number: 6 discovered: 17 finished: 18 parent: 13
number: 7 discovered: 9 finished: 28 parent: 20
number: 8 discovered: 3 finished: 32 parent: 2
number: 9 discovered: 36 finished: 37 parent: -1
number: 10 discovered: 12 finished: 13 parent: 19
number: 11 discovered: 5 finished: 6 parent: 3
number: 12 discovered: 22 finished: 25 parent: 15
number: 13 discovered: 16 finished: 19 parent: 7
number: 14 discovered: 38 finished: 39 parent: -1
number: 15 discovered: 21 finished: 26 parent: 17
number: 16 discovered: 23 finished: 24 parent: 12
number: 17 discovered: 20 finished: 27 parent: 7
number: 18 discovered: 7 finished: 30 parent: 3
number: 19 discovered: 11 finished: 14 parent: 5
number: 20 discovered: 8 finished: 29 parent: 18
Почему: берем, например, вершину 3. Вершина 8
не может быть ее предком в обходе графа в
глубину, т.к. нет ребра из 8 в 3.
Решение не принято.Original comment by aivyu...@gmail.com on 28 Apr 2013 at 7:53
- Changed state: Wrong-or-Errors
Original issue reported on code.google.com by
anna.tat...@gmail.comon 21 Apr 2013 at 10:06