Michael Hackstein
|
25f7b25206
|
Fixed failing failure-tests
|
2015-07-28 13:21:54 +02:00 |
Willi Goesgens
|
0f85dec259
|
Fix memleak with unique_ptr
|
2015-07-15 09:57:35 +02:00 |
Jan Steemann
|
af9c155c90
|
use references
|
2015-07-14 14:05:18 +02:00 |
Michael Hackstein
|
b54dae0d5b
|
Fixed a memleak in newest shortest path shortcut implementation
|
2015-07-13 14:49:54 +02:00 |
Michael Hackstein
|
df33ffe410
|
Added an implementation for shortest path which allows to take shortcuts iff we do not have to access the data, f.e. filtering or distances. Gives an enormous speedup.
|
2015-07-13 11:31:42 +02:00 |
Michael Hackstein
|
933e4c353a
|
Added further OOM tests for ShortestPath computation
|
2015-06-16 11:27:21 +02:00 |
Jan Steemann
|
79ce6eb93b
|
fixed threading issues
|
2015-06-11 09:50:56 +02:00 |
Jan Steemann
|
f5f719360c
|
added out-of-bounds checking for _heap and _history
|
2015-06-10 18:04:17 +02:00 |
Michael Hackstein
|
6eadcb31ff
|
Fixed a bug where the shortest path computation computed the correct distancebut returned a wrong path. It was only triggered under very special conditions
|
2015-05-27 13:42:21 -07:00 |
Jan Steemann
|
d4285fc6fd
|
fix Visual Studio compile warnings
|
2015-05-20 16:12:30 +02:00 |
Jan Steemann
|
688b21fe51
|
fixed namespaces
|
2015-05-20 15:49:39 +02:00 |
Michael Hackstein
|
ca0de62aa3
|
Moved all v8 context sensitive parts into from V8Traverser v8-vocbase
|
2015-05-02 21:46:54 -07:00 |
Max Neunhoeffer
|
8b8f81c25d
|
Fix a nullptr dereferencing bug.
|
2015-05-02 07:03:32 +02:00 |
Max Neunhoeffer
|
97f7743d84
|
Less copying in Traverser.
|
2015-05-02 06:28:52 +02:00 |
Michael Hackstein
|
2ba5ee47df
|
Made everything compile again
|
2015-05-01 17:21:15 -07:00 |
Michael Hackstein
|
91fa1cb6f8
|
Merge branch 'cppTrav3' of github.com:/arangodb/arangodb into cppTrav
|
2015-05-01 17:08:56 -07:00 |
Michael Hackstein
|
9edb48b1cf
|
Made everything compile again
|
2015-05-01 17:07:02 -07:00 |
Michael Hackstein
|
0b65896500
|
User defined move constructor hell...
|
2015-05-01 17:00:43 -07:00 |
Michael Hackstein
|
73db004a85
|
Reduced string copy in traverser
|
2015-05-01 14:49:31 -07:00 |
Max Neunhoeffer
|
24d04148c8
|
Schaltbar.
|
2015-05-01 10:30:30 -07:00 |
Max Neunhoeffer
|
f1ff888088
|
Fix bidirectional switch.
|
2015-04-25 21:47:43 -07:00 |
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 |
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 |