|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectorg.jgrapht.generate.ScaleFreeGraphGenerator<V,E>
public class ScaleFreeGraphGenerator<V,E>
Generates directed or undirected scale-free network of any size. Scale-free network is a connected graph, where degrees of vertices are distributed in unusual way. There are many vertices with small degrees and only small amount of vertices with big degrees.
| Constructor Summary | |
|---|---|
ScaleFreeGraphGenerator(int size)
Constructs a new ScaleFreeGraphGenerator. |
|
ScaleFreeGraphGenerator(int size,
long seed)
Constructs a new ScaleFreeGraphGenerator using fixed seed for the random generator. |
|
| Method Summary | |
|---|---|
void |
generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
java.util.Map<java.lang.String,V> resultMap)
Generates scale-free network with size passed to the constructor. |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public ScaleFreeGraphGenerator(int size)
size - number of vertices to be generated
public ScaleFreeGraphGenerator(int size,
long seed)
size - number of vertices to be generatedseed - initial seed for the random generator| Method Detail |
|---|
public void generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
java.util.Map<java.lang.String,V> resultMap)
generateGraph in interface GraphGenerator<V,E,V>target - receives the generated edges and vertices; if this is
non-empty on entry, the result will be a disconnected graph since
generated elements will not be connected to existing elementsvertexFactory - called to produce new verticesresultMap - unused parameter
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||