function?[G]=erdosRenyi（nvpKreg）
%Funciton?[G]=edosRenyi（nvpKreg）?generates?a?random?graph?based?on
%the?Erdos?and?Renyi?algoritm?where?all?possible?pairs?of?‘nv‘?nodes?are
%connected?with?probability?‘p‘.?
%
%?Inputs:
%???nv?-?number?of?nodes?
%???p??-?rewiring?probability
%???Kreg?-?initial?node?degree?of?for?regular?graph?（use?1?or?even?numbers）
%
%?Output:
%???G?is?a?structure?inplemented?as?data?structure?in?this?as?well?as?other
%???graph?theory?algorithms.
%???G.Adj???-?is?the?adjacency?matrix?（1?for?connected?nodes?0?otherwise）.
%???G.x?and?G.y?-???are?row?vectors?of?size?nv?wiht?the?（xy）?coordinates?of
%???????????????????each?node?of?G.
%???G.nv????-?number?of?vertices?in?G
%???G.ne????-?number?of?edges?in?G
%
%Created?by?Pablo?Blinder.?blinderp@bgu.ac.il

?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件????????1918??2005-01-25?17:14??erdosRenyi.m
?????文件?????????410??2005-01-25?17:03??getNodeCoordinates.m
?????文件?????????333??2003-12-02?23:32??permPairs.m
?????文件????????1935??2005-01-25?17:40??plotGraphBasic.m
?????文件?????????218??2007-06-04?14:14??www.pudn.com.txt