Académique Documents
Professionnel Documents
Culture Documents
Simulation
Raj Jain
Washington University
Saint Louis, MO 63131
Jain@cse.wustl.edu
These slides are available on-line at:
http://www.cse.wustl.edu/~jain/cse574-08/
Washington University in St. Louis CSE574s ©2008 Raj Jain
24-1
Overview
! Input dialog
! Library of data structures, routines, and algorithms
! Big time savings
! Inflexible ⇒ Simplification
" Fixed or variable Δt. Only the first list is kept sorted
t Head 1 Tail 1
2 19 3 28
4 23 5 27 6 39 7 45
8 25 9 47 10 34 11 50 12 48
i 1 2 3 4 5 6 7 8 9 10 11 12
A[i] 15 19 28 23 27 39 45 25 47 34 50 48
Event time for each node is smaller than that of its Children
"
⇒ Root is next
" Heap can be stored as arrays