我看到问答里您说有“复杂网络聚类系数和平均路径长度计算的MATLAB源代码”，可以发给我一份么？
2个回答
展开全部
最短路径长，matlab自带的就有， graphshortestpath 和 graphallshortestpaths
>> help graphshortestpath
GRAPHSHORTESTPATH solves the shortest path problem in graph.
[DIST,PATH,PRED] = GRAPHSHORTESTPATH(G,S) determines the single source
shortest paths from node S to all other nodes in the graph G. Weights of
the edges are all nonzero entries in the n-by-n adjacency matrix
represented by the sparse matrix G. DIST are the n distances from source
to every node (using Inf for non-reachable nodes and zero for the source
node). The PATH contains the winning paths to every node, and PRED
contains the predecessor nodes of the winning paths.
至于聚类系数，我发给你好了。
>> help graphshortestpath
GRAPHSHORTESTPATH solves the shortest path problem in graph.
[DIST,PATH,PRED] = GRAPHSHORTESTPATH(G,S) determines the single source
shortest paths from node S to all other nodes in the graph G. Weights of
the edges are all nonzero entries in the n-by-n adjacency matrix
represented by the sparse matrix G. DIST are the n distances from source
to every node (using Inf for non-reachable nodes and zero for the source
node). The PATH contains the winning paths to every node, and PRED
contains the predecessor nodes of the winning paths.
至于聚类系数，我发给你好了。
来自：求助得到的回答
本回答由提问者推荐
已赞过
已踩过<
评论
收起
你对这个回答的评价是？
展开全部
你好~~我也需要，能也发我一份么？1362574047@qq.com
已赞过
已踩过<
评论
收起
你对这个回答的评价是？
推荐律师服务：
若未解决您的问题，请您详细描述您的问题，通过百度律临进行免费专业咨询
