N
- The label type of nodes in the graph.E
- The label type of edges in the graph.public class MultiClassScaleFreeRewire<N,E> extends ScaleFreeRewire<N,E>
ScaleFreeRewire.m_modes
Modifier and Type | Field and Description |
---|---|
protected int |
p |
a, m, nodes, r
Constructor and Description |
---|
MultiClassScaleFreeRewire(Graph<N,E> graph,
EdgeLabeler<N,E> el) |
Modifier and Type | Method and Description |
---|---|
protected int |
add_like_links(int split,
int numlinks) |
protected boolean |
consider_similar_link(N vi,
N vj,
int numnodes,
int numlinks) |
int |
p() |
MultiClassScaleFreeRewire<N,E> |
p(int p)
The 'p' parameter is the number of links to add between existing, sufficiently alike
nodes on each time-step.
|
protected int |
rewire_callback(int split,
int numlinks) |
_init_nodes, a, a, add_link, add, add, consider_link, link_added, m_mode_stop, m_mode, m_mode, m_mode, m, m, m0, nodes_iterator, rewire
public int p()
p(int)
public MultiClassScaleFreeRewire<N,E> p(int p)
p
- The number of links to consider adding between alike nodes on each time-step.protected boolean consider_similar_link(N vi, N vj, int numnodes, int numlinks)
protected int add_like_links(int split, int numlinks)
protected int rewire_callback(int split, int numlinks)
rewire_callback
in class ScaleFreeRewire<N,E>