A function to extract self-loops away in given network.
SL.extraction(nodelist, edgelist, eadf=NULL,Directed=F, DegreeL=NULL,
InDegreeL=NULL, OutDegreeL=NULL,Nexception=NULL,Eexception=NULL)A “nodelist” object;
An “edgelist” object
A data frame of attributes corresponding to all the edges;
TRUE if edges are directed, FALSE otherwise;
DegreeL
An integer vector of In-degrees for each node in the given “nodelist”, and it could be ignored if edges are undirected
An integer vector of Out-degrees for each node in the given “nodelist”, and it could be ignored if edges are undirected
A vector of node IDs concerned as exceptions, and all the edges with these nodes included won't be processed;
A vector of edge IDs concerned as exceptions, and all these edges won't be processed;
Two types of list returned for undirected and directed edges, respectively:
For “undirected” edges:
New node list with self-loops removed;
New edge list with self-loops removed;
New attribute data frame for the returned edgelist;
New degree vector cooresponding to the newly returned node list;
New node list with self-loops removed;
New edgelist with self-loops removed;
Data frame of attributes for the newly returned edge list;
New In-degree vector cooresponding to the newly returned node list;
New Out-degree vector cooresponding to the newly returned node list;