A function to simplfy multiple-edge into one representative edge, where a multiple-edge structure refers to a set of edges sharing with the same pair of nodes.
ME.simplification(nodelist, edgelist, eadf=NULL, ea.prop=NULL, Directed=F,
DegreeL=NULL, InDegreeL=NULL, OutDegreeL=NULL,Nexception=NULL,
Eexception=NULL)Two types of list returned for undirected and directed edges, respectively:
For “undirected” edges:
New node list with multiple-edges simplified;
New edge list with multiple-edges simplified;
New attribute data frame for the returned edgelist;
New degree vector cooresponding to the newly returned node list;
For “directed” network:
New node list with multiple-edges simplified;
New edgelist with multiple-edges simplified;
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;
A “nodelist” object;
An “edgelist” object
A data frame of attributes corresponding to all the edges;
A vector (of the length equalling to the number of edge attributes in “eadf”) with values of 1, 2, 3 or 4, and each specific value represent a function to assign the attributes of the edited edges, see also Redef.functions:
1->sum(v)
2->min(v)
3->max(v)
4->mean(v)
TRUE if edges are directed, FALSE otherwise;
An integer vector of degrees for each node in the given “nodelist”, and it could be ignored if edges are directed
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;
Binbin Lu binbinlu@whu.edu.cn
SL.extraction, PN.amalgamation