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 |
Max Neunhoeffer
|
aaa8e6a912
|
Fix bidirectional switch.
|
2015-04-26 03:33:55 +02:00 |
Max Neunhoeffer
|
ce32d62094
|
Make a bidirectional switch in Traverser.
|
2015-04-26 03:32:01 +02:00 |
Max Neunhoeffer
|
b8ef4782ca
|
Rename lookup() to find()
|
2015-04-24 08:59:51 -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 |
Max Neunhoeffer
|
8884391da0
|
Merge branch 'cppTrav' of ssh://github.com/ArangoDB/ArangoDB into cppTrav
|
2015-04-23 19:57:39 -07:00 |
Max Neunhoeffer
|
4bdcfdb238
|
New version of PriorityQueue.
|
2015-04-23 19:56:18 -07:00 |
Frank Celler
|
bb3fbff88a
|
Make it compile under Linux.
|
2015-04-23 22:19:14 +00: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 |
Max Neunhoeffer
|
570509a58a
|
Merge branch 'cppTrav' of ssh://github.com/ArangoDB/ArangoDB into cppTrav
|
2015-04-22 23:42:20 -07:00 |
Max Neunhoeffer
|
261c6f7a5e
|
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-22 23:41:26 -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 |