Searched refs:heap (Results 1 – 2 of 2) sorted by relevance
| /phasta/phSolver/AMG/ |
| H A D | ramg_coarse.f | 467 subroutine ramg_initheap(heap,invMap,wght,nheaps,ilen) argument
470 integer,dimension(0:ilen-1),intent(inout) :: heap,invMap local
476 heap(i) = i
482 do while ( ( k.gt.0 ).and.(wght(heap(k)).gt.wght(heap(j))) )
483 t = heap(j)
484 heap(j) = heap(k)
485 heap(k) = t
492 invmap(heap(i)) = i
497 subroutine ramg_popheap(heap,invmap,wght,nheaps,popid,ilen) argument
502 integer,dimension(0:ilen-1),intent(inout) :: heap,invmap local
[all …]
|
| H A D | amgread.txt | 64 thesis, one thing to note is that we use heap sort for lambda array. The
66 the highest value out from the array. So heap sort is a natural choice.
|