Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- У тебя будет примерно так:
- for (int i = 0; i < n; i++){
- // проходишься по всем вершинам
- if (matrix[i][CurVe]){
- if (!visited[i]){
- DFS(i, visited);
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement