From 48209ad3093ec9a095c2c1ccc2c148cde4acc3ba Mon Sep 17 00:00:00 2001 From: Guillaume Gibert Date: Thu, 19 Oct 2023 11:05:07 +0200 Subject: [PATCH] * Clarify the structure of the graph in the doc --- dijkstra.m | 1 + 1 file changed, 1 insertion(+) diff --git a/dijkstra.m b/dijkstra.m index 03a919e..cbfc056 100644 --- a/dijkstra.m +++ b/dijkstra.m @@ -9,6 +9,7 @@ function [distanceToNode, parentOfNode, nodeTrajectory] = dijkstra(nbNodes, visi % -visibilityGraph: a matrix containing the distance between connected nodes % (NaN refers to not connected nodes) % The matrix has a size of (nbNodes+2)x(nbNodes+2) +% The first row/col corresponds to the Starting point, the last row/col to the Goal point. % % Outputs: % - distanceToNode: distance between the current node and its parent