INGOR
|
Complete graph. More...
#include <ytCompleteGraph.h>
Public Member Functions | |
int | ytCompleteGraph_checkEdge (const ytCompleteGraph *this, int src, int dst) |
Checks if the edge exists. | |
Public Attributes | |
ytGraph | super |
int | p |
Complete graph.
This implements the complete graph where all the nodes are connected each other except for the self loop edges.
This is a subclass of ytGraph.
int ytCompleteGraph_checkEdge | ( | const ytCompleteGraph * | this, |
int | src, | ||
int | dst | ||
) |
Checks if the edge exists.
This does not include self loop edges. Thus if src and dst are the same, this returns false.
this | |
src | source node ID. |
dst | distination node ID. |