INGOR
|
#include <math/ytDBNGraph.h>
Public Member Functions | |
ytDBNGraph * | ytDBNGraph_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. | |
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.
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.
int ytDBNGraph_numNodes | ( | const ytDBNGraph * | this | ) |
Returns the number of nodes (vertices).
this | pointer to the ytDBNGraph instance. |
int ytDBNGraph_numParents | ( | const ytDBNGraph * | this, |
int | j | ||
) |
Returns the number of parents of the specified node.
this | pointer to the ytDBNGraph instance. |
j | node index. |