* Clarify the structure of the graph in the doc

This commit is contained in:
Guillaume Gibert 2023-10-19 11:05:07 +02:00
parent 81fd01d377
commit 48209ad309
1 changed files with 1 additions and 0 deletions

View File

@ -9,6 +9,7 @@ function [distanceToNode, parentOfNode, nodeTrajectory] = dijkstra(nbNodes, visi
% -visibilityGraph: a matrix containing the distance between connected nodes % -visibilityGraph: a matrix containing the distance between connected nodes
% (NaN refers to not connected nodes) % (NaN refers to not connected nodes)
% The matrix has a size of (nbNodes+2)x(nbNodes+2) % 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: % Outputs:
% - distanceToNode: distance between the current node and its parent % - distanceToNode: distance between the current node and its parent