根据邻接矩阵求有向网络平均最短路径matlab代码

以下是基于邻接矩阵求有向网络平均最短路径的MATLAB代码：

function [avg_shortest_path] = directed_network_shortest_path(adj_matrix)
% Function to calculate the average shortest path of a directed network
% based on its adjacency matrix
% Inputs:
% adj_matrix : n x n adjacency matrix of the network, where n is the number of nodes
% Outputs:
% avg_shortest_path : average shortest path of the network

n = size(adj_matrix, 1); % number of nodes
dist_matrix = zeros(n); % initialize distance matrix

% initialize distance matrix using adjacency matrix
for i = 1:n
for j = 1:n
if adj_matrix(i, j) ~= 0
dist_matrix(i, j) = adj_matrix(i, j);
else
dist_matrix(i, j) = Inf;
end
end
end

% Floyd-Warshall algorithm to calculate all-pairs shortest paths
for k = 1:n
for i = 1:n
for j = 1:n
if dist_matrix(i, k) + dist_matrix(k, j) < dist_matrix(i, j)
dist_matrix(i, j) = dist_matrix(i, k) + dist_matrix(k, j);
end
end
end
end

% calculate average shortest path
avg_shortest_path = sum(sum(dist_matrix(~isinf(dist_matrix)))) / (n*(n-1));

end

使用示例：

% example adjacency matrix
adj_matrix = [0 1 0 0 0; 0 0 1 0 0; 0 0 0 1 0; 0 0 0 0 1; 1 0 0 0 0];

% calculate average shortest path
avg_shortest_path = directed_network_shortest_path(adj_matrix);

% display result
fprintf('Average shortest path: %.2f\n', avg_shortest_path);