1
0
Fork 0
arangodb/arangod/Graph
Michael Hackstein f986a5f06c Improved the cost estimation of traversals to be independent from max search depth. This fixes #3917 (#3944)
LGTM
2017-12-07 10:05:35 +01:00
..
AttributeWeightShortestPathFinder.cpp
AttributeWeightShortestPathFinder.h
BaseOptions.cpp
BaseOptions.h
BreadthFirstEnumerator.cpp
BreadthFirstEnumerator.h
ClusterTraverserCache.cpp
ClusterTraverserCache.h
ConstantWeightShortestPathFinder.cpp
ConstantWeightShortestPathFinder.h
EdgeCollectionInfo.cpp
EdgeCollectionInfo.h
EdgeCursor.h
EdgeDocumentToken.h
NeighborsEnumerator.cpp
NeighborsEnumerator.h
PathEnumerator.cpp
PathEnumerator.h
ShortestPathFinder.h
ShortestPathOptions.cpp
ShortestPathOptions.h
ShortestPathPriorityQueue.h
ShortestPathResult.cpp
ShortestPathResult.h
SingleServerEdgeCursor.cpp
SingleServerEdgeCursor.h
SingleServerTraverser.cpp
SingleServerTraverser.h
Traverser.cpp
Traverser.h
TraverserCache.cpp
TraverserCache.h
TraverserCacheFactory.cpp
TraverserCacheFactory.h
TraverserDocumentCache.cpp
TraverserDocumentCache.h
TraverserOptions.cpp
TraverserOptions.h