implement dijkstra's algorithm in matlab

main.m
% Example: Creating a graph with 4 nodes and 5 edges
G = graph([1 1 2 2 3],[2 3 3 4 4],[4 2 5 6 1]);
101 chars
3 lines

main.m
% Example: Setting the source node as node 1
sourceNode = 1;
61 chars
3 lines

main.m
% Example: Initializing the distance and visited arrays
numNodes = numnodes(G);
distance = Inf(1,numNodes);
visited = false(1,numNodes);
distance(sourceNode) = 0;
163 chars
6 lines

main.m
% Example: Traverse through the graph
for i = 1:numNodes
   % Find the node with smallest distance from source node
   [minDist, currNode] = min(distance(~visited));
   if isempty(currNode)
       break;
   end
   % Update visited array
   visited(currNode) = true;
   % Check each adjacent node for shortest path update
   adjNodes = neighbors(G,currNode);
   for j = 1:length(adjNodes)
      if ~visited(adjNodes(j))
          edgeWeight = G.Edges.Weight(findedge(G,currNode,adjNodes(j)));
          newDist = minDist + edgeWeight;
          if newDist < distance(adjNodes(j))
              distance(adjNodes(j)) = newDist;
          end
      end
   end
end
661 chars
22 lines

main.m
% Example: Output the distance array
distance
46 chars
3 lines