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

[nevermore3]

• 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]

What type of PR is this?

• bug
• feature
• enhancement

What problem(s) does this PR solve?

Issue(s) number:

Description:

How do you solve it?

Special notes for your reviewer, ex. impact of this fix, design document, etc:

Checklist:

Tests:

• Unit test(positive and negative cases)
• Function test
• Performance test
• N/A

Affects:

• Documentation affected (Please add the label if documentation needs to be modified.)
• Incompatibility (If it breaks the compatibility, please describe it and add the label.）
• If it's needed to cherry-pick (If cherry-pick to some branches is required, please label the destination version(s).)
• Performance impacted: Consumes more CPU/Memory

Release notes:

Please confirm whether to be reflected in release notes and how to describe:

ex. Fixed the bug .....

[yixinglu]

@nevermore3 plz fix the tck tests

[nevermore3]

@nevermore3 plz fix the tck tests

done

[codecov-commenter]

Codecov Report

Base: 77.22% // Head: 77.28% // Increases project coverage by +0.06% 🎉

Coverage data is based on head (f6b2597) compared to base (cc0ce34).
Patch coverage: 83.03% of modified lines in pull request are covered.

Additional details and impacted files

@@            Coverage Diff             @@
##           master    #5002      +/-   ##
==========================================
+ Coverage   77.22%   77.28%   +0.06%     
==========================================
  Files        1105     1105              
  Lines       82059    82104      +45     
==========================================
+ Hits        63366    63458      +92     
+ Misses      18693    18646      -47     

Impacted Files	Coverage Δ
src/graph/executor/query/ProjectExecutor.cpp	61.11% <ø> (-2.78%)	⬇️
src/graph/executor/query/TraverseExecutor.cpp	84.90% <82.06%> (+17.19%)	⬆️
src/graph/executor/query/TraverseExecutor.h	96.42% <95.23%> (-3.58%)	⬇️
src/meta/processors/parts/GetSpaceProcessor.cpp	61.29% <0.00%> (-19.36%)	⬇️
src/kvstore/raftex/Host.cpp	71.70% <0.00%> (-2.58%)	⬇️
src/meta/processors/parts/ListHostsProcessor.cpp	69.52% <0.00%> (-2.15%)	⬇️
src/storage/mutate/AddVerticesProcessor.cpp	86.07% <0.00%> (-2.11%)	⬇️
src/kvstore/raftex/RaftPart.cpp	69.54% <0.00%> (-2.07%)	⬇️
src/parser/GraphScanner.h	92.63% <0.00%> (-2.00%)	⬇️
... and 29 more

Help us with your feedback. Take ten seconds to tell us how you rate us. Have a feature suggestion? Share it here.

☔ View full report at Codecov.
📢 Do you have feedback about the report comment? Let us know in this issue.

[Aiee]

Consider use robin_hood::unordered_flat_ to replace std::set and std::map

[Aiee]

Consider use robin_hood::unordered_flat_ to replace std::set and std::map

[nevermore3]

Consider use robin_hood::unordered_flat_ to replace std::set and std::map

will be considered if there is a significant improvement in performance

[Aiee]

Consider use robin_hood::unordered_flat_ to replace std::set and std::map