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

#include <math/ytDBNGraph.h>

Public Member Functions

ytDBNGraphytDBNGraph_new (int p, int T, ytGraph *g)
 Generates a new ytDBNGraph instance.
 
int ytDBNGraph_checkEdge (const ytDBNGraph *this, int src, int dst)
 Checks if the specified edge exists.
 
int ytDBNGraph_numNodes (const ytDBNGraph *this)
 Returns the number of nodes (vertices).
 
int ytDBNGraph_numParents (const ytDBNGraph *this, int j)
 Returns the number of parents of the specified node.
 

Detailed Description

The ytDBNGraph is a ytGraph class and can be used to generate the time-expanded (multiple time steps) version of the given graph where there are different nodes that corresponds to each time step or time point of a certain node.

Member Function Documentation

◆ ytDBNGraph_new()

ytDBNGraph * ytDBNGraph_new ( int  p,
int  T,
ytGraph g 
)

Generates a new ytDBNGraph instance.

If g is NULL, the generated graph consists of the complete bipartite graph between consecutive time nodes.

◆ ytDBNGraph_numNodes()

int ytDBNGraph_numNodes ( const ytDBNGraph this)

Returns the number of nodes (vertices).

Parameters
thispointer to the ytDBNGraph instance.

◆ ytDBNGraph_numParents()

int ytDBNGraph_numParents ( const ytDBNGraph this,
int  j 
)

Returns the number of parents of the specified node.

Parameters
thispointer to the ytDBNGraph instance.
jnode index.
Returns
the number of parents of the j -th node.

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