Modified event queue. 1. Used an array of linkedlist to replace the priorityqueue.      This makes both -  insertion and deletion operation  O(1) instead of O(logN).      Increased speed by 20-30 KIPS
Modified event queue.
1. Used an array of linkedlist to replace the priorityqueue.
     This makes both -  insertion and deletion operation  O(1) instead of O(logN).
     Increased speed by 20-30 KIPS

abhishek4747/Tejas-git,abhishek4747/Tejas-git,abhishek4747/Tejas-git,abhishek4747/Tejas-git,abhishek4747/Tejas-git,abhishek4747/Tejas-git