add

MODULE_EXSOLVER.f90

@@ -3,20 +3,35 @@ MODULE MODULE_EXSOLVER
     use MODULE_PRECISION
     use MODULE_CFD_DATA
     use MODULE_QUADTREE
+    use MODULE_GENERICMETHOD
+    use MODULE_TIMESOLVER
+
+    private
+    public  :: second_EX
 
     contains
 !==================================================================================================
     subroutine Second_EX(first, last, tree, dt)
     implicit none
     integer(ip), intent(in) :: first, last
-    real(rp), intent(out)   :: dt
+    real(rp), intent(inout) :: dt
     type(quadtree), dimension(first:last), intent(inout)    :: tree
 
+    call loop_on_quadtree_array(first, last, tree, second_Ex_single)
+
+    call compute_dt_array(first, last, tree, dt)
+
     return
     end subroutine Second_EX
-!==================================================================================================    
-!==================================================================================================    
-!==================================================================================================    
+!==================================================================================================   
+    subroutine second_Ex_single(tree)
+    implicit none
+    type(quadtree), pointer, intent(inout)   :: tree
+
+    return
+    end subroutine second_EX_single
+!================================================================================================== 
+
 !==================================================================================================    
 
 END MODULE MODULE_EXSOLVER    

MODULE_SOLVER.f90

@@ -196,7 +196,7 @@ subroutine solving(first, last, tree, I_solver_type)
     ! ===> call solver <===
 
     time = zero;    iter = 0
-    do while (l_stop)
+    do while (.not. l_stop)
 
         iter = iter + 1
 

MODULE_TIMESOLVER.f90

@@ -0,0 +1,38 @@
+MODULE MODULE_TIMESOLVER
+
+    use MODULE_PRECISION
+    use MODULE_CONSTANTS
+    use MODULE_QUADTREE
+
+    contains
+!=================================================================================================    
+    subroutine compute_dt_array(first, last, tree, dt)
+    implicit none
+    integer(ip), intent(in)     :: first, last
+    type(quadtree), dimensioN(first:last), intent(in)   :: tree
+    real(rp), intent(inout)     :: dt
+    integer(ip)                 :: i
+
+    do i = first, last
+        call compute_dt_single(tree(i), dt)
+    end do
+
+    return
+    end subroutine compute_dt_array
+!==================================================================================================  
+    recursive subroutine compute_dt_single(tree, dt)
+    implicit none
+    type(quadtree), intent(in)  :: tree
+    real(rp), intent(inout)     :: dt
+
+    if (.not. tree%is_leaf) then 
+        call compute_dt_single(tree%north_west, dt)
+        call compute_dt_single(tree%north_east, dt)
+        call compute_dt_single(tree%south_west, dt)
+        call compute_dt_single(tree%south_east, dt)
+    else
+        dt = min(dt, tree%data%dt)
+    end if
+    return
+    end subroutine compute_dt_single
+END MODULE MODULE_TIMESOLVER