INGOR
Loading...
Searching...
No Matches
Public Member Functions | List of all members
ytRNDGraph Class Reference

Generating random graphs. More...

#include <ytRNDGraph.h>

Public Member Functions

int * ytRNDGraph_sfDag (ytGraph *g, ytRNG *rng, double deg)
 Generating a scale-free directed acyclic graph using the modified barabasi-albert model.
 
int * ytRNDGraph_sfDagType (ytGraph *g, ytRNG *rng, double deg, double r, int md, int *type)
 Generating a scale-free directed acyclic graph using the modified barabasi-albert model.
 
int * ytRNDGraph_dag (ytGraph *g, ytRNG *rng, double deg)
 Generates a random DAG.
 
int * ytRNDGraph_dbn (ytGraph *g, ytRNG *rng, int T, double deg)
 Generates a DBN graph.
 

Detailed Description

Generating random graphs.

Random Graph Generating Routines.

Member Function Documentation

◆ ytRNDGraph_dbn()

int * ytRNDGraph_dbn ( ytGraph g,
ytRNG rng,
int  T,
double  deg 
)

Generates a DBN graph.

A DBN graph is a graph where edges connect only between nodes of the consecutive time points.

Parameters
ggraph instance.
rngytRNG isntance.
Tnumber of time points.
degaverage degree of nodes.

◆ ytRNDGraph_sfDag()

int * ytRNDGraph_sfDag ( ytGraph g,
ytRNG rng,
double  deg 
)

Generating a scale-free directed acyclic graph using the modified barabasi-albert model.

Parameters
[in,out]ggraph. The number of nodes of the graph is given by this instance.
rngRandom number generator. If NULL is specified, is is automatically generated and initialized by the current time.
Returns
topological order of nodes. Only edges r[i] -> r[j] for i < j exist where r is the returned pointer.

◆ ytRNDGraph_sfDagType()

int * ytRNDGraph_sfDagType ( ytGraph g,
ytRNG rng,
double  deg,
double  r,
int  md,
int *  type 
)

Generating a scale-free directed acyclic graph using the modified barabasi-albert model.

Parameters
[in,out]ggraph. The number of nodes of the graph is given by this instance.
rngRandom number generator. If NULL is specified, is is automatically generated and initialized by the current time.
rratio of discrete variables.
mdmaximum number of parents of discrete node.
[out]typetype id will be set in type. The values are types of ytData.
Returns
topological order of nodes. Only edges r[i] -> r[j] exsit where r is the returned pointer.
See also
ytData

The documentation for this class was generated from the following file: