Dijkstra_Methode(Ma​trix, start, target)

버전 1.1.0.0 (3.37 KB) 작성자: Ingo Hermann
This is the Dijkstra Methode implemented in Matlab for finding the shortest path.
다운로드 수: 123
업데이트 날짜: 2016/12/16

라이선스 보기

With this Dijkstra Methode one can find the shortest path of an image.
(See here description http://physingo-en.blogspot.de/2016/12/matlab-dijkstra-methode-large.html)
function [path, prev, unvis, distance, start, target] = Dijkstra_Methode(Matrix, start, target)
Matrix is the incoming image
start is the start point in a vector [a,b] where a is the column and b the row
target is the end point similare to start
path is the matrix with ones excepted at the position of the path where it is 0
prev are also the previous visited pixels where the algorithm took the
wrong way
unvis are all unvisited pixels
distance is the distance or weight of the pixels

인용 양식

Ingo Hermann (2025). Dijkstra_Methode(Matrix, start, target) (https://kr.mathworks.com/matlabcentral/fileexchange/60712-dijkstra_methode-matrix-start-target), MATLAB Central File Exchange. 검색 날짜: .

MATLAB 릴리스 호환 정보
개발 환경: R2016b
모든 릴리스와 호환
플랫폼 호환성
Windows macOS Linux
카테고리
Help CenterMATLAB Answers에서 Dijkstra algorithm에 대해 자세히 알아보기

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
버전 게시됨 릴리스 정보
1.1.0.0

Update 1.1: Added a comment

1.0.0.0