ytCompleteGraphSL Class Reference

Complete graph. More...

#include <ytCompleteGraphSL.h>

Public Member Functions
int	ytCompleteGraphSL_checkEdge (const ytCompleteGraphSL *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. Unlike ytCompleteGraph, this includes self loop edges.

This is a subclass of ytGraph.

Member Function Documentation

ytCompleteGraphSL_checkEdge()

int ytCompleteGraphSL_checkEdge	(	const ytCompleteGraphSL *	this,
		int	src,
		int	dst
	)

Checks if the edge exists.

This includes self loop edges. Thus, this always returns true.

Parameters

this
src	source node ID.
dst	distination node ID.

Returns

true

---

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

• math/ytCompleteGraphSL.h
• math/ytCompleteGraphSL.c