grph.algo.topology

Class RandomNewmanWattsStrogatzTopologyGenerator

java.lang.Object

grph.algo.topology.RandomizedTopologyTransform

grph.algo.topology.RandomNewmanWattsStrogatzTopologyGenerator

All Implemented Interfaces:

TopologyGenerator

public class RandomNewmanWattsStrogatzTopologyGenerator
extends RandomizedTopologyTransform

From the SageMath documentation: First create a ring over n nodes. Then each node in the ring is connected with its k nearest neighbors. Then shortcuts are created by adding new edges as follows: for each edge u-v in the underlying 'n-ring with k nearest' neighbors'; with probability p add a new edge u-w with" + "randomly-chosen existing node w. Takes a non-empty graph as input.

Constructor Summary

Constructors

Constructor and Description
RandomNewmanWattsStrogatzTopologyGenerator()

Method Summary

Modifier and Type	Method and Description
void	compute(Grph g)
static void	compute(Grph g, int k, double p)
int	getK()
double	getP()
static void	main(java.lang.String[] args)
void	setK(int k)
void	setP(double p)

Methods inherited from class grph.algo.topology.RandomizedTopologyTransform

getPRNG, setPRNG

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

RandomNewmanWattsStrogatzTopologyGenerator

public RandomNewmanWattsStrogatzTopologyGenerator()

Method Detail

getK

public int getK()

setK

public void setK(int k)

getP

public double getP()

setP

public void setP(double p)

compute

public void compute(Grph g)

main

public static void main(java.lang.String[] args)

compute

public static void compute(Grph g,
                           int k,
                           double p)