Finding the shortest path in a cell array based on given input
Mostrar comentarios más antiguos
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 comentarios
Adam Danz
el 22 de Nov. de 2019
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
el 22 de Nov. de 2019
Respuesta aceptada
Más respuestas (0)
Categorías
Más información sobre Sparse Matrices en Centro de ayuda y File Exchange.
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!