This function is 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, see nodelist;
An edgelist object, see edgelist;
Attribute data frame for all the edges;
A logical parameter to specify whether edges are directed or not;
A vector (of length equal to the number of nodes) of degrees for the nodes, and it should be null if “Directed” is TRUE;
A vector (of length equal to the number of nodes) of in-degrees for the nodes;
A vector of out-degrees for the nodes;
A vector of node IDs considered as exceptions, and all the nodes included won't be processed;
A vector of edge IDs considered as exceptions, and all the edges included won't be processed;
Two types of list for undirected and directed edges respectively: For undirected type:
The new “nodelist” with self-loops extracted;
The new “edgelist” with self-loops extracted;
The new attribute data frame for the amended edgelist;
The new degree vector cooresponding to the returned nodelist;
The new “nodelist” with self-loops extracted;
The new “edgelist” with self-loops extracted;
The new attribute data frame for the returned edgelist;
The new in-degree vector cooresponding to the returned “nodelist”;
The new out-degree vector cooresponding to the returned “nodelist”;
If edges in the “edgelist” are directed, the InDegreeL and OutDegreeL will be calculated (if not given) and updated synchronized with self-loop extration; otherwise only DegreeL is returned.