build path base on BFS through adjancency list (vesoft-inc#1669)

* build path base on BFS through adjancency list * fix error * add multi-thread * fix error * change filter path * fix ci test error * address comment Co-authored-by: Yee <2520865+yixinglu@users.noreply.github.com>
nevermore3 · Dec 9, 2022 · 3f2c635 · 3f2c635
1 parent a7b28fd
commit 3f2c635
Show file tree

Hide file tree

Showing 4 changed files with 430 additions and 375 deletions.
diff --git a/src/graph/executor/query/ProjectExecutor.cpp b/src/graph/executor/query/ProjectExecutor.cpp
@@ -15,7 +15,6 @@ folly::Future<Status> ProjectExecutor::execute() {
   auto *project = asNode<Project>(node());
   auto iter = ectx_->getResult(project->inputVar()).iter();
   DCHECK(!!iter);
-  QueryExpressionContext ctx(ectx_);
 
   if (FLAGS_max_job_size <= 1) {
     auto ds = handleJob(0, iter->size(), iter.get());