In graph's problems, a problem is very interesting and made me enjoyable, that is finding all cycles in directed graph problem. During process solve this problem, I discover some difficulty points, and now, i need solve them.
The following is difficult that I'm encountering:
1. How to traverse graph ( by DFS) to find cycle?
2. How to find maximum cycle from a vertex?
Không có nhận xét nào:
Đăng nhận xét