Graph Class Reference

This class represents one graph. More...

#include <graph.h>

Public Member Functions
	Graph (const vector< short unsigned int > &vertices, vector< string > *ptr_map_vertices_indexToLabel, const vector< bool > &linkableVertices, const unsigned int &type, const bool &isSpherical, const unsigned int &dataSupp=0)
	Constructeur. More...
bool	isSubgraphOf (const Graph *grBig) const
	Test if a graph (spherical) is a subgraph of another graph (spherical or euclidean) More...
bool	isSubgraphOf_spherical_spherical (const Graph *grBig) const
	Test if a graph (spherical) is a subgraph of another graph (spherical) graph. More...
bool	isSubgraphOf_spherical_euclidean (const Graph *grBig) const
	Test if a graph (spherical) is a subgraph of another graph (euclidean) graph. More...

Public Attributes
vector< short unsigned int >	vertices
	Vertices of the graph. More...
vector< bool >	linkableVertices
unsigned int	type
	Type of the graph: A=0, B=1, ... More...
unsigned int	dataSupp
	In the case of G_2^n, the weight. More...
bool	isSpherical
	True if spherical, false if euclidean. More...

Static Private Member Functions
static bool	isAnSubAm (const vector< short unsigned int > &subGraphVertices, const vector< short unsigned int > &bigGraphVertices)

Private Attributes
vector< string > *	ptr_map_vertices_indexToLabel
	Pointeur vers la correspondance. More...
bool	b_map_vertices_indexToLabelIsEmpty

Friends
bool	operator== (const Graph &g1, const Graph &g2)
bool	operator< (const Graph &g1, const Graph &g2)
ostream &	operator<< (ostream &, Graph const &)

Detailed Description

This class represents one graph.

Constructor & Destructor Documentation

Graph()

Graph::Graph	(	const vector< short unsigned int > &	vertices,
		vector< string > *	ptr_map_vertices_indexToLabel,
		const vector< bool > &	linkableVertices,
		const unsigned int &	type,
		const bool &	isSpherical,
		const unsigned int &	dataSupp = 0
	)

Constructeur.

Parameters

vertices(const	vector<short unsigned int>&) Sommets composant le graphe
ptr_map_vertices_indexToLabel(vector<	string > *) Pointeur vers la correspondance index --> label des sommets
linkableVertices(const	vector< bool >&) Ce à quoi le graphe est liable
type	(const unsigned int &) Type du graphe: A=0, B=1, ...
isSpherical(const	bool& ) True si sphérique, false si euclidien
dataSupp(const	unsigned int &) Eventuelle information supplémentaire, par exemple poids pour le G2

Member Function Documentation

isAnSubAm()

bool Graph::isAnSubAm ( const vector< short unsigned int > &  subGraphVertices, const vector< short unsigned int > &  bigGraphVertices  )

staticprivate

isSubgraphOf()

Graph::isSubgraphOf

(

const Graph *

grBig

)

const

Test if a graph (spherical) is a subgraph of another graph (spherical or euclidean)

\param grBig(Graph*) Bigger graph
\return True if the *this is a subgraph of the graph given in parameter,

false otherwise

isSubgraphOf_spherical_euclidean()

Graph::isSubgraphOf_spherical_euclidean

(

const Graph *

grBig

)

const

Test if a graph (spherical) is a subgraph of another graph (euclidean) graph.

\param grBig(Graph*) Bigger graph
\return True if the *this is a subgraph of the graph given in parameter,

false otherwise

isSubgraphOf_spherical_spherical()

Graph::isSubgraphOf_spherical_spherical

(

const Graph *

grBig

)

const

Test if a graph (spherical) is a subgraph of another graph (spherical) graph.

\param grBig(Graph*) Bigger graph
\return True if the *this is a subgraph of the graph given in parameter,

false otherwise

Friends And Related Function Documentation

operator<

bool operator< ( const Graph &  g1, const Graph &  g2  )

friend

operator<<

ostream& operator<< ( ostream &  o, Graph const &  g  )

friend

operator==

bool operator== ( const Graph &  g1, const Graph &  g2  )

friend

Member Data Documentation

b_map_vertices_indexToLabelIsEmpty

bool Graph::b_map_vertices_indexToLabelIsEmpty

private

dataSupp

unsigned int Graph::dataSupp

In the case of G_2^n, the weight.

isSpherical

bool Graph::isSpherical

True if spherical, false if euclidean.

linkableVertices

vector<bool> Graph::linkableVertices

A quels sommets on peut lier le graphe { sommets } \ { sommets du graphes et leurs voisins)

ptr_map_vertices_indexToLabel

vector<string>* Graph::ptr_map_vertices_indexToLabel

private

Pointeur vers la correspondance.

type

unsigned int Graph::type

Type of the graph: A=0, B=1, ...

vertices

vector<short unsigned int> Graph::vertices

Vertices of the graph.

---

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

• graph.h
• graph.cpp