1
0
Fork 0
Commit Graph

14 Commits

Author SHA1 Message Date
Max Neunhoeffer b8ef4782ca Rename lookup() to find() 2015-04-24 08:59:51 -07:00
Max Neunhoeffer 589a32cda4 Disable bidirectional search for now. 2015-04-24 08:48:02 -07:00
Max Neunhoeffer d3d84385a1 Use new PriorityQueue, compiles, does not work. 2015-04-24 08:43:51 -07:00
Max Neunhoeffer b66c167ac7 Fix double occurence in result. 2015-04-24 00:32:07 -07:00
Max Neunhoeffer c55b62b609 Sort out mess with strange non-copying. 2015-04-24 06:45:39 +00:00
Max Neunhoeffer e30ae28ce5 Snapshot. 2015-04-23 22:24:59 -07:00
Max Neunhoeffer 68f4720c6b Use our threads. 2015-04-23 22:05:00 -07:00
Michael Hackstein 3b13222f59 Added shortcut if there is no possible way for shortest path 2015-04-23 19:58:27 -07:00
Frank Celler bb3fbff88a Make it compile under Linux. 2015-04-23 22:19:14 +00:00
Michael Hackstein 80e002cfc9 Fixed problem with thread construction for constant string 2015-04-23 15:18:56 -07:00
Michael Hackstein 48e4fd55a8 Added version with broken threads. Computation is correct, but threads do not fire up 2015-04-23 13:40:41 -07:00
Michael Hackstein 771b54b2cf Further implementation of Shortest Path. The Shortest path is found in cpp conversion to JS not yet working 2015-04-22 17:03:06 -07:00
Michael Hackstein aff8048e30 Started implementing the Expander function. Not et finished does not compile but i am moving over to a new machine 2015-04-21 12:01:44 -07:00
Michael Hackstein 8e345651c0 Proper class wrapping of Traverser. Started implemented dual-sided search algorithm. Implemented shered memmory access. Next up threads 2015-04-20 17:04:18 -07:00