14 Commits

Author	SHA1	Message	Date
Max Neunhoeffer	cda687ef9b	Make a bidirectional switch in Traverser.	2015-04-25 21:47:43 -07:00
Max Neunhoeffer	fbfe019913	Rename lookup() to find()	2015-04-25 21:41:45 -07:00
Max Neunhoeffer	e508a1697d	Use new PriorityQueue, compiles, does not work.	2015-04-25 21:41:45 -07:00
Max Neunhoeffer	3fc8243432	Fix double occurence in result.	2015-04-25 21:40:45 -07:00
Max Neunhoeffer	5ccab6b3a8	Sort out mess with strange non-copying.	2015-04-25 21:40:44 -07:00
Max Neunhoeffer	2c5f56672c	Snapshot.	2015-04-25 21:39:04 -07:00
Max Neunhoeffer	e7e690913a	Use our threads.	2015-04-25 21:38:07 -07:00
Max Neunhoeffer	b56901f4d5	New version of PriorityQueue.	2015-04-25 21:38:07 -07:00
Frank Celler	3c6801b559	Make it compile under Linux.	2015-04-25 21:38:07 -07:00
Michael Hackstein	c1c98b16f6	Added version with broken threads. Computation is correct, but threads do not fire up	2015-04-25 21:36:24 -07:00
Max Neunhoeffer	a553548d87	Add a new priority queue implementation. ... This blends a deque and a binary heap to implement a priority queue as it is useful for the shortest path search.	2015-04-25 21:35:40 -07:00
Michael Hackstein	6f81b0add1	Further implementation of Shortest Path. The Shortest path is found in cpp conversion to JS not yet working	2015-04-25 21:35:40 -07:00
Michael Hackstein	9f1830b4c5	Started implementing the Expander function. Not et finished does not compile but i am moving over to a new machine	2015-04-25 21:34:41 -07:00
Michael Hackstein	015c197e2a	Proper class wrapping of Traverser. Started implemented dual-sided search algorithm. Implemented shered memmory access. Next up threads	2015-04-25 21:34:40 -07:00