nl_tokens: Generates a binomial graph graph with n nodes .
pl_tokens: function erdosRenyi ( GraphClass , options ) { if ( ! isGraphConstructor ( GraphClass ) ) throw new Error ( 'graphology-generators/random/erdos-renyi: invalid Graph constructor.' ) ; var order = options . order , probability = options . probability , rng = options . rng || Math . random ; var graph = new GraphClass ( ) ; // If user gave a size, we need to compute probability if ( typeof options . approximateSize === 'number' ) { var densityFunction = density [ graph . type + 'Density' ] ; probability = densityFunction ( order , options . approximateSize ) ; } if ( typeof order !== 'number' || <mask> <= 0 ) throw new Error ( 'graphology-generators/random/erdos-renyi: invalid `order`. Should be a positive number.' ) ; if ( typeof probability !== 'number' || probability < 0 || probability > 1 ) throw new Error ( 'graphology-generators/random/erdos-renyi: invalid `probability`. Should be a number between 0 and 1. Or maybe you gave an `approximateSize` exceeding the graph\'s density.' ) ; if ( typeof rng !== 'function' ) throw new Error ( 'graphology-generators/random/erdos-renyi: invalid `rng`. Should be a function.' ) ; for ( var i = 0 ; i < order ; i ++ ) graph . addNode ( i ) ; if ( probability <= 0 ) return graph ; if ( order > 1 ) { var iterator = combinations ( range ( order ) , 2 ) , path , step ; while ( ( step = iterator . next ( ) , ! step . done ) ) { path = step . value ; if ( graph . type !== 'directed' ) { if ( rng ( ) < probability ) graph . addUndirectedEdge ( path [ 0 ] , path [ 1 ] ) ; } if ( graph . type !== 'undirected' ) { if ( rng ( ) < probability ) graph . addDirectedEdge ( path [ 0 ] , path [ 1 ] ) ; if ( rng ( ) < probability ) graph . addDirectedEdge ( path [ 1 ] , path [ 0 ] ) ; } } } return graph ; }