divyang4481 / mipt-hw

Automatically exported from code.google.com/p/mipt-hw
0 stars 0 forks source link

task08 DFS на списке (Таташина) #216

Closed GoogleCodeExporter closed 9 years ago

GoogleCodeExporter commented 9 years ago
tatashina_anna/task08_dfs_list/

Original issue reported on code.google.com by anna.tat...@gmail.com on 21 Apr 2013 at 10:10

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:41: warning: comparison between signed and unsigned integer 
expressions [-Wsign-compare]
main.cpp: In function 'void DFS_list(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. Решение неверное.
То же самое: вершина 8 не может быть 
родителем вершины 3.

Решение не принято.

Original comment by aivyu...@gmail.com on 28 Apr 2013 at 7:54

GoogleCodeExporter commented 9 years ago
исправила.. вроде бы как. По крайней мере 
учла, что граф дан ориентированный. 

Original comment by anna.tat...@gmail.com on 28 Apr 2013 at 9:14

GoogleCodeExporter commented 9 years ago
А Вы проверяете свое решение на 
каких-нибудь маленьких входных данных?

Original comment by aivyu...@gmail.com on 28 Apr 2013 at 9:44

GoogleCodeExporter commented 9 years ago
Да, вроде работает.

Original comment by anna.tat...@gmail.com on 30 Apr 2013 at 5:35

GoogleCodeExporter commented 9 years ago
Да, вроде работает.

Original comment by anna.tat...@gmail.com on 30 Apr 2013 at 5:35

GoogleCodeExporter commented 9 years ago
Решение принято.

Original comment by aivyu...@gmail.com on 10 May 2013 at 8:28