mirror of https://gitee.com/bigwinds/arangodb
Renamed ConstDistanceFinder => ConstantWeightShortestPathFinder
This commit is contained in:
parent
30095556e9
commit
ee57f9abef
|
@ -41,7 +41,7 @@ typedef arangodb::graph::AttributeWeightShortestPathFinder<
|
||||||
arangodb::traverser::ShortestPath>
|
arangodb::traverser::ShortestPath>
|
||||||
ArangoDBPathFinder;
|
ArangoDBPathFinder;
|
||||||
|
|
||||||
typedef arangodb::graph::ConstDistanceFinder<
|
typedef arangodb::graph::ConstantWeightShortestPathFinder<
|
||||||
arangodb::velocypack::Slice, arangodb::velocypack::Slice,
|
arangodb::velocypack::Slice, arangodb::velocypack::Slice,
|
||||||
arangodb::basics::VelocyPackHelper::VPackStringHash,
|
arangodb::basics::VelocyPackHelper::VPackStringHash,
|
||||||
arangodb::basics::VelocyPackHelper::VPackStringEqual,
|
arangodb::basics::VelocyPackHelper::VPackStringEqual,
|
||||||
|
@ -366,7 +366,7 @@ ShortestPathBlock::ShortestPathBlock(ExecutionEngine* engine,
|
||||||
EdgeWeightExpanderCluster(this, false),
|
EdgeWeightExpanderCluster(this, false),
|
||||||
EdgeWeightExpanderCluster(this, true), _opts.bidirectional));
|
EdgeWeightExpanderCluster(this, true), _opts.bidirectional));
|
||||||
} else {
|
} else {
|
||||||
_finder.reset(new arangodb::graph::ConstDistanceFinder<
|
_finder.reset(new arangodb::graph::ConstantWeightShortestPathFinder<
|
||||||
arangodb::velocypack::Slice, arangodb::velocypack::Slice,
|
arangodb::velocypack::Slice, arangodb::velocypack::Slice,
|
||||||
arangodb::basics::VelocyPackHelper::VPackStringHash,
|
arangodb::basics::VelocyPackHelper::VPackStringHash,
|
||||||
arangodb::basics::VelocyPackHelper::VPackStringEqual,
|
arangodb::basics::VelocyPackHelper::VPackStringEqual,
|
||||||
|
@ -382,7 +382,7 @@ ShortestPathBlock::ShortestPathBlock(ExecutionEngine* engine,
|
||||||
EdgeWeightExpanderLocal(this, false),
|
EdgeWeightExpanderLocal(this, false),
|
||||||
EdgeWeightExpanderLocal(this, true), _opts.bidirectional));
|
EdgeWeightExpanderLocal(this, true), _opts.bidirectional));
|
||||||
} else {
|
} else {
|
||||||
_finder.reset(new arangodb::graph::ConstDistanceFinder<
|
_finder.reset(new arangodb::graph::ConstantWeightShortestPathFinder<
|
||||||
arangodb::velocypack::Slice, arangodb::velocypack::Slice,
|
arangodb::velocypack::Slice, arangodb::velocypack::Slice,
|
||||||
arangodb::basics::VelocyPackHelper::VPackStringHash,
|
arangodb::basics::VelocyPackHelper::VPackStringHash,
|
||||||
arangodb::basics::VelocyPackHelper::VPackStringEqual,
|
arangodb::basics::VelocyPackHelper::VPackStringEqual,
|
||||||
|
|
|
@ -30,7 +30,7 @@ namespace arangodb {
|
||||||
namespace graph {
|
namespace graph {
|
||||||
|
|
||||||
template <typename VertexId, typename EdgeId, typename HashFuncType, typename EqualFuncType, typename Path>
|
template <typename VertexId, typename EdgeId, typename HashFuncType, typename EqualFuncType, typename Path>
|
||||||
class ConstDistanceFinder : public ShortestPathFinder<VertexId, Path> {
|
class ConstantWeightShortestPathFinder : public ShortestPathFinder<VertexId, Path> {
|
||||||
public:
|
public:
|
||||||
|
|
||||||
//////////////////////////////////////////////////////////////////////////////
|
//////////////////////////////////////////////////////////////////////////////
|
||||||
|
@ -59,10 +59,10 @@ class ConstDistanceFinder : public ShortestPathFinder<VertexId, Path> {
|
||||||
ExpanderFunction _rightNeighborExpander;
|
ExpanderFunction _rightNeighborExpander;
|
||||||
|
|
||||||
public:
|
public:
|
||||||
ConstDistanceFinder(ExpanderFunction left, ExpanderFunction right)
|
ConstantWeightShortestPathFinder(ExpanderFunction left, ExpanderFunction right)
|
||||||
: _leftNeighborExpander(left), _rightNeighborExpander(right) {}
|
: _leftNeighborExpander(left), _rightNeighborExpander(right) {}
|
||||||
|
|
||||||
~ConstDistanceFinder() {
|
~ConstantWeightShortestPathFinder() {
|
||||||
clearVisited();
|
clearVisited();
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
|
@ -71,7 +71,7 @@ class ShortestPath {
|
||||||
friend class arangodb::graph::AttributeWeightShortestPathFinder<
|
friend class arangodb::graph::AttributeWeightShortestPathFinder<
|
||||||
arangodb::velocypack::Slice, arangodb::velocypack::Slice, double,
|
arangodb::velocypack::Slice, arangodb::velocypack::Slice, double,
|
||||||
ShortestPath>;
|
ShortestPath>;
|
||||||
friend class arangodb::graph::ConstDistanceFinder<
|
friend class arangodb::graph::ConstantWeightShortestPathFinder<
|
||||||
arangodb::velocypack::Slice, arangodb::velocypack::Slice,
|
arangodb::velocypack::Slice, arangodb::velocypack::Slice,
|
||||||
arangodb::basics::VelocyPackHelper::VPackStringHash,
|
arangodb::basics::VelocyPackHelper::VPackStringHash,
|
||||||
arangodb::basics::VelocyPackHelper::VPackStringEqual, ShortestPath>;
|
arangodb::basics::VelocyPackHelper::VPackStringEqual, ShortestPath>;
|
||||||
|
|
Loading…
Reference in New Issue