public class BarabasiAlbertGenerator extends BaseGenerator
This is a very simple graph generator that generates a graph using the preferential attachment rule defined in the Barabási-Albert model: nodes are generated one by one, and each time attached by one or more edges other nodes. The other nodes are chosen using a biased random selection giving more chance to a node if it has a high degree.
The more this generator is iterated, the more nodes are generated. It can
therefore generate graphs of any size. One node is generated at each call to
nextEvents(). At each node added at least one new edge is added. The
number of edges added at each step is given by the
getMaxLinksPerStep(). However by default the generator creates a
number of edges per new node chosen randomly between 1 and
getMaxLinksPerStep(). To have exactly this number of edges at each
new node, use setExactlyMaxLinksPerStep(boolean).
Graph graph = new SingleGraph("Barabàsi-Albert");
// Between 1 and 3 new links per node added.
Generator gen = new BarabasiAlbertGenerator(3);
// Generate 100 nodes:
gen.addSink(graph);
gen.begin();
for(int i=0; i<100; i++) {
gen.nextEvents();
}
gen.end();
graph.display();
| Constructor and Description |
|---|
BarabasiAlbertGenerator()
New generator.
|
BarabasiAlbertGenerator(int maxLinksPerStep) |
BarabasiAlbertGenerator(int maxLinksPerStep,
boolean exactlyMaxLinksPerStep) |
| Modifier and Type | Method and Description |
|---|---|
void |
begin()
Start the generator.
|
void |
end()
Clean degrees.
|
int |
getMaxLinksPerStep()
Maximum number of edges created when a new node is added.
|
boolean |
nextEvents()
Step of the generator.
|
boolean |
produceExactlyMaxLinkPerStep()
True if the generator produce exactly
getMaxLinksPerStep(), else
it produce a random number of links ranging between 1 and
getMaxLinksPerStep(). |
void |
setExactlyMaxLinksPerStep(boolean on)
Set if the generator produce exactly
getMaxLinksPerStep()
(true), else it produce a random number of links ranging between 1 and
getMaxLinksPerStep() (false). |
void |
setMaxLinksPerStep(int max)
Set how many edge (maximum) to create for each new node added.
|
addEdgeAttribute, addEdgeLabels, addNodeAttribute, addNodeLabels, isUsingInternalGraph, removeEdgeAttribute, removeNodeAttribute, setDirectedEdges, setEdgeAttributesRange, setNodeAttributesRange, setRandomSeed, setUseInternalGraphaddAttributeSink, addElementSink, addSink, attributeSinks, clearAttributeSinks, clearElementSinks, clearSinks, elementSinks, removeAttributeSink, removeElementSink, removeSink, sendAttributeChangedEvent, sendAttributeChangedEvent, sendEdgeAdded, sendEdgeAdded, sendEdgeAttributeAdded, sendEdgeAttributeAdded, sendEdgeAttributeChanged, sendEdgeAttributeChanged, sendEdgeAttributeRemoved, sendEdgeAttributeRemoved, sendEdgeRemoved, sendEdgeRemoved, sendGraphAttributeAdded, sendGraphAttributeAdded, sendGraphAttributeChanged, sendGraphAttributeChanged, sendGraphAttributeRemoved, sendGraphAttributeRemoved, sendGraphCleared, sendGraphCleared, sendNodeAdded, sendNodeAdded, sendNodeAttributeAdded, sendNodeAttributeAdded, sendNodeAttributeChanged, sendNodeAttributeChanged, sendNodeAttributeRemoved, sendNodeAttributeRemoved, sendNodeRemoved, sendNodeRemoved, sendStepBegins, sendStepBeginspublic BarabasiAlbertGenerator()
public BarabasiAlbertGenerator(int maxLinksPerStep)
public BarabasiAlbertGenerator(int maxLinksPerStep,
boolean exactlyMaxLinksPerStep)
public int getMaxLinksPerStep()
public boolean produceExactlyMaxLinkPerStep()
getMaxLinksPerStep(), else
it produce a random number of links ranging between 1 and
getMaxLinksPerStep().getMaxLinksPerStep().public void setMaxLinksPerStep(int max)
max - The new maximum, it must be strictly greater than zero.public void setExactlyMaxLinksPerStep(boolean on)
getMaxLinksPerStep()
(true), else it produce a random number of links ranging between 1 and
getMaxLinksPerStep() (false).on - Does the generator generates exactly
getMaxLinksPerStep().public void begin()
Generator.begin()public boolean nextEvents()
setMaxLinksPerStep(int).
The complexity of this method is O(n) with n the number of nodes if the
number of edges created per new node is 1, else it is O(nm) with m the
number of edges generated per node.Generator.nextEvents()public void end()
end in interface Generatorend in class BaseGeneratorGenerator.end()Copyright © 2015. All rights reserved.