ytCompleteGraph Class Reference

Complete graph. More...

#include <ytCompleteGraph.h>

Public Member Functions
int	ytCompleteGraph_checkEdge (const ytCompleteGraph *this, int src, int dst)
	Checks if the edge exists. More...

Public Attributes
ytGraph	super
int	p

Detailed Description

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.

Member Function Documentation

ytCompleteGraph_checkEdge()

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.

Parameters

this
src	source node ID.
dst	distination node ID.

Returns

true except that src and dst are identical.

---

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

• math/ytCompleteGraph.h
• math/ytCompleteGraph.c