travere the graph and visit all the connected nodes
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| integer, | intent(in) | :: | i |
recursive subroutine traverse(i) !! travere the graph and visit all the connected nodes integer,intent(in) :: i integer :: j if (visited(i)) return visited(i) = .true. do j = 1, size(graph(i)%connections) call traverse(graph(i)%connections(j)) end do end subroutine traverse