This web application visualizes Henriksens Algorithm which is a data structure useful for next-event simulations. The data structure is composed of a doubly linked list that carries a binary tree on top of it which is used as a dynamic index of that list. The list is always sorted by the event times of its elements. The tree is used to insert new events at their correct position in the list with a runtime of O(log n) instead of O(n).
App in Action: https://bobmcfry.github.io/henriksen-algorithm/
The algorithm was written in Javascript and follows the paper "Event List Management - A Tutorial" and an implementation in C by Christopher Copper.
GNU General Public License v3.0
Copyright © 2016 Christian Heiden
This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.