Shortest path

[nevermore3]

What type of PR is this?

• bug
• feature
• enhancement

What problem(s) does this PR solve?

Issue(s) number:

Description:

Traverse the data in the CartesianProduct, and call the shortestPath function for each line. each call to the shortestPath function uses a thread to execute. then write result(matched path) to the index corresponding to the resultDs_ array. finally collect the data in the resultDs_ array in the collect stage and return

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 .....

Discussed it with Mingquan offline, it is compatible.

[wey-gu]

Cheers 🎉
ping @Reid00

[wey-gu]

How do you solve it?

This digram is phenomenal👍🏻, it'll be even better to come with both Chinese and English ;-D

[Reid00]

is this merged on next version 3.2.0?

[wey-gu]

is this merged on next version 3.2.0?

yes, it's merged in master and I think will be cherry-picked to the base of 3.2.0 branch.

[Sophie-Xie]

is this merged on next version 3.2.0?

@Reid00 Of course, it's in v3.2.0. The branch of v3.2.0 has not been pulled from master yet.

[Reid00]

yes. I noticed that. thank you @wey-gu @Shylock-Hg I will try this feature after v3.2.0 is released.

[abby-cyber]

vesoft-inc/nebula-docs-cn#2527