⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 mexgraphallnodeshortestpasses.m

📁 复杂网络的一些节点面对攻击的代码
💻 M
字号:
function [ShortesPasses, varargin] = mexGraphAllNodeShortestPasses(Graph,Node,Direction)
% For the specified node in graph, the function returns a list of ALL shortes passes to each of the nodes, connected to the Node.
%
% Receives:
%       Graph       -   Graph Struct			-   the graph loaded with GraphLoad
%		Node		-	Node index				-	the index of the source node for all passes.
%		Direction	-	string					-	(optional) Either 'direct', 'inverse' or 'both'. Case insensitive. The incoming or outgoing links are followed.
%
% Returns:
%		ShortesPasses		- cell array				-  a cell array which contains all Shortes passes for each node connected to the 'Node' 
%		PassLengthHistogram	- array						-  (optional) Contains number of shortest passes initiated at the specifield node for each length. 1'st element is always 1 as there is only 1 pass of length 0 ([Node]).
%
% Example:
%	Graph = GraphLoad('E:\Projects\Evolution\Results\Evolution103._0_0\Evolution103.83.Graph');
%	[A  B]= mexGraphAllNodeShortestPasses(Graph,1);
%
% See Also:
%       GraphBetweennessCentrality
%
%Created:																							
%	Lev Muchnik,	17-18/03/2005
%	lev@topspin.co.il, +972-54-326496			

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -