.. |
AttributeWeightShortestPathFinder.cpp
|
fixing weighted shortest path finder
|
2017-06-02 12:15:18 +02:00 |
AttributeWeightShortestPathFinder.h
|
Replaced EdgeCursors callback to return cid,rev instead of _id. Does less costly copying and comparision internally
|
2017-05-31 17:49:46 +02:00 |
BaseOptions.cpp
|
Revert "Feature/optimizer rule remove filter covered by traversal" (#2724)
|
2017-07-04 11:13:36 +02:00 |
BaseOptions.h
|
Adapted the traverser code to make conditions for the used index and for post-filtering non-overlapping. If the post-filtering is empty it is not evaluated at all.
|
2017-06-09 17:01:26 +02:00 |
BreadthFirstEnumerator.cpp
|
Edge index refactoring
|
2017-06-02 11:20:15 +02:00 |
BreadthFirstEnumerator.h
|
Replaced EdgeCursors callback to return cid,rev instead of _id. Does less costly copying and comparision internally
|
2017-05-31 17:49:46 +02:00 |
ClusterTraverserCache.cpp
|
Edge index refactoring
|
2017-06-02 11:20:15 +02:00 |
ClusterTraverserCache.h
|
Edge index refactoring
|
2017-06-02 11:20:15 +02:00 |
ConstantWeightShortestPathFinder.cpp
|
Edge index refactoring
|
2017-06-02 11:20:15 +02:00 |
ConstantWeightShortestPathFinder.h
|
Replaced EdgeCursors callback to return cid,rev instead of _id. Does less costly copying and comparision internally
|
2017-05-31 17:49:46 +02:00 |
EdgeCursor.h
|
Replaced EdgeCursors callback to return cid,rev instead of _id. Does less costly copying and comparision internally
|
2017-05-31 17:49:46 +02:00 |
EdgeDocumentToken.cpp
|
Replaced EdgeCursors callback to return cid,rev instead of _id. Does less costly copying and comparision internally
|
2017-05-31 17:49:46 +02:00 |
EdgeDocumentToken.h
|
cppcheck
|
2017-05-31 18:07:25 +02:00 |
NeighborsEnumerator.cpp
|
Removed a duplicate uniqueness check of vertices in Neighbors Iterator
|
2017-06-06 15:33:50 +02:00 |
NeighborsEnumerator.h
|
Squashed commit of the following:
|
2017-03-27 14:30:06 +02:00 |
ShortestPathFinder.h
|
Replaced the velocypack ConstantDistance ShortestPath API by a StringRef & TraverserCache version. This should be save for RocksDB. This commit fails in ClusterMode.
|
2017-04-12 14:21:53 +02:00 |
ShortestPathOptions.cpp
|
Adapted the traverser code to make conditions for the used index and for post-filtering non-overlapping. If the post-filtering is empty it is not evaluated at all.
|
2017-06-09 17:01:26 +02:00 |
ShortestPathOptions.h
|
Adapted the traverser code to make conditions for the used index and for post-filtering non-overlapping. If the post-filtering is empty it is not evaluated at all.
|
2017-06-09 17:01:26 +02:00 |
ShortestPathPriorityQueue.h
|
Renamed PriorityQueue => ShortestPathPriorityQueue
|
2017-04-05 16:12:47 +02:00 |
ShortestPathResult.cpp
|
Fixed an undefined behaviour bug in shortest-path implementation introduced with the latest reordering
|
2017-06-01 11:05:26 +02:00 |
ShortestPathResult.h
|
fixed struct/class confusion
|
2017-06-01 12:06:14 +02:00 |
SingleServerEdgeCursor.cpp
|
fix #277 make use of nextExtra
|
2017-06-27 12:30:55 +02:00 |
SingleServerEdgeCursor.h
|
fix #277 make use of nextExtra
|
2017-06-27 12:30:55 +02:00 |
TraverserCache.cpp
|
Fixed a misplaced edge filter It checked for a condition on the wrong depth.
|
2017-06-29 17:03:05 +02:00 |
TraverserCache.h
|
Edge index refactoring
|
2017-06-02 11:20:15 +02:00 |
TraverserCacheFactory.cpp
|
Replaced EdgeCursors callback to return cid,rev instead of _id. Does less costly copying and comparision internally
|
2017-05-31 17:49:46 +02:00 |
TraverserCacheFactory.h
|
Replaced EdgeCursors callback to return cid,rev instead of _id. Does less costly copying and comparision internally
|
2017-05-31 17:49:46 +02:00 |
TraverserDocumentCache.cpp
|
Augmented cache API and fixed a potential deadlock scenario. (#2579)
|
2017-06-19 17:28:04 +02:00 |
TraverserDocumentCache.h
|
Replaced EdgeCursors callback to return cid,rev instead of _id. Does less costly copying and comparision internally
|
2017-05-31 17:49:46 +02:00 |