Finding the shortest path in a cell array based on given input
이전 댓글 표시
If I have a call array of n - 1x2 vectors, how do I find the shortest path using a combination of these n vectors based on a given input
example using 6 vectors:
existing cell array - { [0 1], [1 2], [2 3], [3 4], [0 3], [1 4] }
input - [0 4]
expected output - {[0 1], [1 4]} or {[0 3],[3 4]}
edit: fixed input
댓글 수: 2
Adam Danz
2019년 11월 22일
What do you mean "shortest path"?
Are the pairs of valure (x,y) coordinates such that you have 6 dots and you're trying to find which dot is closest to the input coordinate?
I don't understand how the outputs map onto the input.
Shawn Castelino
2019년 11월 22일
채택된 답변
추가 답변 (0개)
카테고리
도움말 센터 및 File Exchange에서 Sparse Matrices에 대해 자세히 알아보기
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!