function?BC=betweenness_bin（G）
%BC=betweenness_bin（G）;?betweenness?centrality?BC?for?a?binary?directed?graph?G
%
%Betweenness?may?be?normalised?to?[01]?via?BC/[（N-1）（N-2）]
%
%Algorithm?of?Kintali?generalised?to?directed?and?disconnected?graphs
%http://www.cc.gatech.edu/~kintali/papers/bc.pdf
%
%Mika?Rubinov?UNSW?2007?（last?modified?July?2008）

n=length（G）;????????????????%number?of?nodes
I=eye（n）~=0;????????????????%logical?identity?matrix
d=1;?????????????????????	%path?length
NPd=G;??????????????????????%number?of?paths?of?length?|d|
NSPd=NPd;??????????????????	%number?of?shortest?paths?of?length?|d|
NSP=NSPd;?NSP（I）=1;????????	%number?of?shortest?p