Skip to content

Commit

Permalink
build path base on BFS through adjancency list (#1669)
Browse files Browse the repository at this point in the history
* 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 <[email protected]>
  • Loading branch information
nevermore3 and yixinglu committed Dec 6, 2022
1 parent 7d27f32 commit bcab031
Show file tree
Hide file tree
Showing 4 changed files with 430 additions and 375 deletions.
1 change: 0 additions & 1 deletion src/graph/executor/query/ProjectExecutor.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -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());
Expand Down
Loading

0 comments on commit bcab031

Please sign in to comment.